A packet filter placement problem with application to defense against spoofed denial of service attacks

European Journal of Operational Research

Volumn 176, Issue 2, 2007, Pages 1283-1292

  Armbruster, Benjamin ^a   Smith, J Cole ^b   Park, Kihong ^c  

^a University of Arizona   (United States)

^b University of Arizona   (United States)

^c Purdue University   (United States)

Author keywords

Combinatorial optimization; Internet; Route based packet filtering; Spoofed denial of service attack; Vertex cover

Indexed keywords

COMBINATORIAL OPTIMIZATION; ROUTE BASED PACKET FILTERING; SPOOFED DENIAL OF SERVICE ATTACK; VERTEX COVER;

COMBINATORIAL MATHEMATICS; COMPUTER NETWORKS; INFORMATION SERVICES; INTERNET; OPTIMIZATION; PROBLEM SOLVING; ROUTERS;

PACKET NETWORKS;

EID: 33749539695     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.09.031     Document Type: Article

References (18)

1. S. Axelsson, Research in intrusion detection systems: A survey, Tech. Rep. TR 98-17, Chalmers University of Technology, 1999.
2. Balas E., and Ho A.C. Set covering algorithms using cutting planes, heuristics, and subgradient optimization. Mathematical Programming Study 12 (1980) 37-60
3. Computer Emergency Response Team (CERT), Advisory CA-2000-01 Denial-of-service developments, 2000. Available from: .
4. CERT/CC, SANS Institute, and CERIAS, Consensus roadmap for defeating distributed denial of service attacks, 2000. Available from: .
5. Conforti M., Cornuéjols G., Kapoor A., and Vuskovic K. Perfect, ideal and balanced matrices. European Journal of Operational Research 133 3 (2001) 455-461
6. El-Darzi E., and Mitra G. Solution of set-covering and set-partitioning problem using assignment relaxations. Journal of the Operational Research Society 5 (1992) 483-493
7. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the Internet topology, in: Proc. ACM SIGCOMM, 1999, pp. 251-262.
8. P. Ferguson, D. Senie, Network Ingress Filtering: Defeating Denial of Service Attacks which Employ IP Source Address Spoofing, RFC 2827, 2000.
9. Fisher M.L., and Kedia P. Optimal solution of set covering/partitioning problems using dual heuristics. Management Science 36 (1990) 674-688
10. Garber L. Denial-of-service attacks rip the Internet. Computer 33 4 (2000) 12-17
11. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, San Francisco
12. Hall P. On representatives of subsets. Journal of the London Mathematical Society 10 (1935) 26-35
13. Hochbaum D.S. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11 3 (1982) 555-556
14. Hochbaum D.S. Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. European Journal of Operational Research 140 2 (2002) 291-321
15. K. Park, H. Lee, On the effectiveness of probabilistic packet marking for IP traceback under denial of service attack, in: Proc. IEEE INFOCOM, 2001, pp. 338-347.
16. K. Park, H. Lee, On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets, in: Proc. ACM SIGCOMM, 2001, pp. 15-26.
17. S. Savage, D. Wetherall, A. Karlin, T. Anderson, Practical network support for IP traceback, in: Proc. of ACM SIGCOMM, 2000, pp. 295-306.
18. M. Schultz, E. Eskin, E. Zadok, S. Stolfo, Data mining methods for detection of new malicious executables, in: Proc. IEEE Symposium on Security and Privacy, 2001, pp. 178-184.