Compact neighbor discovery (A bandwidth defense through bandwidth optimization)

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2005, Pages 2711-2719

  Mutaf, Pars ^a   Castelluccia, Claude ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERFACE INDENTIFIERS; LINK LAYER MULTICAST; NEIGHBOR DISCOVERY DENIAL-OF-SERVICE (ND-DOS); WIRELESS BRIDGES;

BROADCASTING; MOBILE TELECOMMUNICATION SYSTEMS; OPTIMIZATION; PACKET NETWORKS; ROUTERS; SECURITY OF DATA;

BANDWIDTH;

EID: 25644451310     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498554     Document Type: Conference Paper

References (17)

1. T. Narten, E. Nordmark, and W. Simpson, "Neighbor Discovery for IP Version 6 (IPv6)," RFC 2461, IETF, December 1998.
2. D. Plummer, "An Ethernet Address Resolution Protocol," RFC 826, IETF, November 1982.
3. P. Nikander et al., "IPv6 Neighbor Discovery (ND) Trust Models and Threats," RFC 3756, IETF, May 2004.
4. T. Aura, "Cryptographically Generated Addresses (CGA)," draft-ietfsend-cga-06, Internet Draft (work in progress), October 2004.
5. J. Arkko et al., "SEcure Neighbor Discovery (SEND)," draft-ietf-sendndopt-05, Internet Draft (work in progress), April 2004.
6. D. Johnson, C. Perkins, and J. Arkko, "Mobility Support in IPv6," RFC 3775, IETF, June 2004.
7. B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, July 1970.
8. A. Conta and S. Deering, "Internet Control Message Protocol (ICMPv6) for the Internet Protocol Version 6 (IPv6) Specification," RFC 2463, IETF, December 1998.
9. L. Fan, P. Cao, J. Aldeida, and A. Broder, "Summary Cache: A scalable wide-area Web cache sharing protocol.," in Proceedings of SIGCOMM'98 Conference, October 1998, vol. 28, pp. 254-265, Corrected version available at URL: http://www.cs.wisc.edu/~cao/papers/summarycache.html.
10. R. Rivest, "The MD5 Message-Digest Algorithm," RFC 1321, IETF, April 1992.
11. S. Dharmapurikar et al, "Longest Prefix Matching Using Bloom Filters," in Proceedings of SIGCOMM'03 Conference, Karlsruhe (Germany), August 2003.
12. M. C. Little et al, "Using bloom filters to speed-up name lookup in distributed systems," Computer Journal, vol. 45, no. 6, pp. 645-652, 2002.
13. P. Ferguson and D. Senie, "Network Ingress Filtering: Defeating Denial of Service Attacks which employ IP Source Address Spoofing," RFC 2267, IETF, January 1998.
14. S. Bellovin et al., "ICMP Traceback Messages," Internet Draft, work in progress, IETF, February 2003.
15. Savage et al., S., "Practical Network Support for IP Traceback," Technical report uw-cse-2000-02-01, department of computer science and engineering, university of Washington, http://www.cs.washington.edu/ homes/savage/traceback.html.
16. Computer Emergence and Response Team (CERT), "CERT Advisory CA-1996-21 TCP SYN Flooding and IP Spoofing Attacks," http://www.cert.org/ advisories/ca-1996-21.html, Last revised November 2000.
17. Computer Emergence and Response Team (CERT), "CERT Advisory CA-1998-01 Smurf IP Denial-of-Service Attacks," http://www.cert.org/ advisories/ca-1998-01.html, Last revised March 2000.