A Model to Partly but Reliably Distinguish DDOS Flood Traffic from Aggregated One. (29th June 2011)

• Record Type: Journal Article
• Authors: Li, Ming; Zhao, Wei
• Other Names: Chen Shengyong Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2012(2012)
• Publication Date: 2011-06-29
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2012/860569
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : Reliable distinguishing DDOS flood traffic from aggregated traffic is desperately desired by reliable prevention of DDOS attacks. By reliable distinguishing, we mean that flood traffic can be distinguished from aggregated one for a predetermined probability. The basis to reliably distinguish flood traffic from aggregated one is reliable detection of signs of DDOS flood attacks. As is known, reliably distinguishing DDOS flood traffic from aggregated traffic becomes a tough task mainly due to the effects of flash-crowd traffic. For this reason, this paper studies reliable detection in the underlying DiffServ network to use static-priority schedulers. In this network environment, we present a method for reliable detection of signs of DDOS flood attacks for a given class with a given priority. There are two assumptions introduced in this study. One is that flash-crowd traffic does not have all priorities but some. The other is that attack traffic has all priorities in all classes, otherwise an attacker cannot completely achieve its DDOS goal. Further, we suppose that the protected site is equipped with a sensor that has a signature library of the legitimate traffic with the priorities flash-crowd traffic does not have. Based on those, we are able to reliably distinguish attack traffic from aggregated traffic with the priorities that flash-crowd traffic does not have according to a given detection probability.