Tradeoffs in probabilistic packet marking for IP traceback

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 407-418

  Adler, Micah ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION THEORY; INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; PROBABILITY;

PROBABILISTIC PACKET MARKING; TRACEBACK;

COMPUTATION THEORY;

EID: 0036036842     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509967.509969     Document Type: Conference Paper

References (18)

1. Tradeoffs in probabilistic packet marking for IP traceback
2. Reconstructing algebraic functions from mixed data
3. ICMP traceback messages
4. Tracing anonymous packets to their approximate source
5. Analyzing distributed denial of service attack tools: The shaft case
6. An algebraic approach to IP traceback
7. Using router stamping to identify the source of IP packets
8. RFC 2267: Network ingress filtering: Defeating denial of service attacks which employ IP source address spoofing
9. Random early detection gateways for congestion avoidance
10. Tracing the source of network attack: A technical, legal and societal problem
11. On the effectiveness of probabilistic packet marking for IP traceback under denial of service attack
12. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets
13. IP mobility support
14. Effective erasure codes for reliable computer communication protocols
15. Practical network support for IP traceback
16. Hash-based IP traceback
17. Advanced and authenticated marking schemes for IP traceback