论文信息 - Near-Optimal Defense Strategies against DDoS Attacks Based upon Packet Filtering and Blocking Enabled by Packet Marking

Near-Optimal Defense Strategies against DDoS Attacks Based upon Packet Filtering and Blocking Enabled by Packet Marking

In the paper, the DDoS scenario is modelled as a mathematical programming problem. The defender strategically utilizes the limited resources to maximize the legitimate traffic, and he can adopt packet marking to observe the network status. The information extracts from the marking field can help the defender develop a defense strategy which combines packet filtering and packet blocking. A Lagrangean relaxation-based algorithm is proposed to optimally solve the problem.

Pei-Yu Chen | Frank Yeong-Sung Lin | Chun-Wei FanChiang

[1] Martin P. Loeb,et al. CSI/FBI Computer Crime and Security Survey , 2004 .

[2] Ion Stoica,et al. Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[3] David K. Y. Yau,et al. On Defending Against Distribtued Denial- of-Service Attacks with Server-Centric Router Throttles , 2001 .

[4] William Stallings,et al. Cryptography and network security , 1998 .

[5] Damien Magoni,et al. Analysis of the autonomous system network topology , 2001, CCRV.

[6] Peter Reiher,et al. A taxonomy of DDoS attack and DDoS defense mechanisms , 2004, CCRV.

[7] M.T. Goodrich,et al. Probabilistic Packet Marking for Large-Scale IP Traceback , 2008, IEEE/ACM Transactions on Networking.

[8] R. Power. CSI/FBI computer crime and security survey , 2001 .

[9] Jung-Min Park,et al. A Divide-and-Conquer Strategy for Thwarting Distributed Denial-of-Service Attacks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[10] Marshall L. Fisher,et al. The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..