The optimal deployment of filters to limit forged address attacks in communication networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3073, Issue , 2004, Pages 239-251

  Mofya, Enock Chisonge ^a   Smith, Jonathan Cole ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; OPTIMIZATION;

CARDINALITIES; GREEDY HEURISTICS; INTEGER PROGRAM; OPTIMAL DEPLOYMENT; RESEARCH APPROACH; SOLUTION QUALITY;

PROBLEM SOLVING;

EID: 33748420090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25952-7_18     Document Type: Article

References (6)

1. B. Armbruster, J.C. Smith, and K. Park, A packet filter placement problem with application to defense against Distributed Denial of Service attacks, Working Paper, The University of Arizona, Tucson, AZ, 2004.
2. Computer Emergency Response Team (CERT), CERT Advisory CA-2000-01 Denial-of-service developments, January 2000. http://www.cert.org/advisories/CA-2000-01.html.
3. P. Ferguson and D. Senie, Network ingress filtering: Defeating denial of service attacks which employ IP source address spoofing, May 2000. RFC 2827.
4. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
5. G.L. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, Inc. New York, NY, 1988.
6. K. Park and H. Lee. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets. In Proc. ACM SIGCOMM '01, pages 15-26, 2001.