Longest Prefix Matching Using Bloom Filters

Computer Communication Review

Volumn 33, Issue 4, 2003, Pages 201-212

  Dharmapurikar, Sarang ^a   Krishnamurthy, Praveen ^a   Taylor, David E ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

Forwarding; IP Lookup; Longest Prefix Matching

Indexed keywords

ALGORITHMS; DATA STRUCTURES; INFORMATION RETRIEVAL; NETWORK PROTOCOLS; PACKET SWITCHING; SEARCH ENGINES; STATIC RANDOM ACCESS STORAGE;

FORWARDING TABLE; INTERNET PROTOCOL (IP) LOOKUP; LONGEST PREFIX MATCHING;

INTERNET;

EID: 1242332554     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/863977.863979     Document Type: Conference Paper

References (21)

1. BGP Table Data. http://bgp.potaroo.net/, February 2003.
2. IPv6 Operational Report. http://net-stats.ipv6.-tilab.com/bgp/bgp-table-snapshot.txt/, February 2003.
3. B. H. Bloom. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 13(7):422-426, July 1970.
4. A. Broder and M. Mitzenmacher. Network applications of Bloom Filters: A survey. In Proceedings of 40th Annual Allerton Conference, October 2002.
5. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small Forwarding Tables for Fast Routing Lookups. In ACM SIGCOMM, 1997.
6. B. Dipert. Special Purpose SRAMs smooth the ride. EDN, Jun 1999.
7. W. N. Eatherton. Hardware-Based Internet Protocol Prefix Lookups. thesis, Washington University in St. Louis, 1998. Available at http://www.arl.wustl.edu/.
8. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: A scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, June 2000.
9. S. Fuller, T. Li, J. Yu, and K. Varadhan. Classless inter-domain routing (CIDR): an address assignment and aggregation strategy. RFC 1519, September 1993.
10. P. Gupta, S. Lin, and N. McKeown. Routing Lookups in Hardware at Memory Access Speeds. In IEEE INFOCOM, 1998.
11. R. Hinden and S. Deering. Internet Version 6 (IPv6) Addressing Architecture. RFC 3513, April 2003.
12. IANA. IPv6 Address Allocation and Assignment Policy. http://www.iana.org/ipaddress/ipv6-allocation-policy-26jun02; June 2002.
13. B. Lampson, V. Srinivasan, and G. Varghese. IP Lookups Using Multiway and Multicolumn Search. IEEE/ACM Transactions on Networking, 7(3):324-334, 1999.
14. A. J. McAulay and P. Francis. Fast Routing Table Lookup Using CAMs. In IEEE INFOCOM, 1993.
15. Micron Technology Inc. 36Mb DDR SIO SRAM 2-Word Burst. Datasheet, December 2002.
16. Micron Technology Inc. Harmony TCAM 1Mb and 2Mb. Datasheet, January 2003.
17. R. K. Montoye. Apparatus for Storing "Don't Care" in a Content Addressable Memory Cell. United States Patent 5,319,590, June 1994. HaL Computer Systems, Inc.
18. SiberCore Technologies Inc. SiberCAM Ultra-18M SCT1842. Product Brief, 2002.
19. K. Sklower. A tree-based routing table for Berkeley Unix. Technical report, University of California, Berkeley, 1993.
20. V. Srinivasan and G. Varghese. Faster IP Lookups using Controlled Prefix Expansion. In BIOMETRICS, 1998.
21. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable high speed IP routing table lookups. In Proceedings of ACM SIGCOMM '97, pages 25-36, September 1997.