Longest prefix matching using bloom filters

IEEE/ACM Transactions on Networking

Volumn 14, Issue 2, 2006, Pages 397-409

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

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Bloom filter; Computer networking; IP lookup; Longest prefix matching

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA STRUCTURES; INTERNET; OPTIMIZATION; RANDOM ACCESS STORAGE; ROUTERS;

BLOOM FILTER; COMPUTER NETWORKING; INTERNET PROTOCOL (IP) ROUTING; LONGEST PREFIX MATCHING; ROUTING LOOKUPS;

NETWORK PROTOCOLS;

EID: 33645983944     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2006.872576     Document Type: Article

References (21)

1. BGP Table Data. Feb. 2003 [Online]. Available: http://bgp.potaroo.net/
2. IPv6 Operational Report. Feb. 2003 [Online]. Available: http://net-stats.ipv6.tilab.com/bgp/bgp-table-snapshot.txt/
3. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422-426, Jul. 1970.
4. A. Broder and M. Mitzenmacher, "Network applications of Bloom filters: a survey," in Proc. 40th Annu. Allerton Conf., Oct. 2002.
5. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small forwarding tables for fast routing lookups," in Proc. ACM SIGCOMM, 1997, pp. 3-14.
6. B. Dipert, "Special purpose SRAMs smooth the ride," EDN, pp. 93-104, Jun. 1999.
7. W. N. Eatherton, "Hardware-based Internet Protocol prefix lookups," M.S. thesis, Electr. Eng. Dept., Washington Univ., St. Louis, MO, 1998. [Online]. Available: 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 Trans. Netw., vol. 8, no. 3, pp. 281-293, Jun. 2000.
9. S. Fuller, T. Li, J. Yu, and K. Varadhan, Classless inter-domain routing (CIDR): An address assignment and aggregation strategy. RFC 1519, Sep. 1993.
10. P. Gupta, S. Lin, and N. McKeown, "Routing Lookups in Hardware at Memory Access Speeds," in Proc. IEEE INFOCOM, 1998, pp. 1240-1247.
11. R. Hinden and S. Deering, Internet Version 6 (IPv6) addressing architecture. RFC 3513, Apr. 2003.
12. IANA, IPv6 Address Allocation and Assignment Policy, Jun. 2002. [Online]. Available: http://www.iana.org/ipaddress/ ipv6-allocation-policy-26jun02
13. B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," IEEE/ACM Trans. Netw., vol. 7, no. 3, pp. 324-334, Jun. 1999.
14. A. J. McAulay and P. Francis, "Fast routing table lookup using CAMS," in Proc. IEEE INFOCOM, 1993, pp. 1382-1391.
15. Micron Technology Inc., 36 Mb DDR SIO SRAM 2-Word Burst. Datasheet, Dec. 2002.
16. Micron Technology Inc., Harmony TCAM 1Mb and 2Mb. Datasheet, Jan. 2003.
17. R. K. Montoye, " Apparatus for storing "Don't Care" in a content addressable memory cell," U.S. Patent 5,319,590, Jun. 7, 1994.
18. SiberCore Technologies Inc., SiberCAM Ultra-18M SCT1842. Product Brief, 2002.
19. K. Sklower, A tree-based routing table for Berkeley Unix Univ. California, Berkeley, 1993, Technical report.
20. V. Srinivasan and G. Varghese, "Faster IP lookups using controlled prefix expansion," in Proc. ACM SIGMETRICS, 1998, pp. 1-10.
21. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing table lookups," in Proc. ACM SIGCOMM, Sep. 1997, pp. 25-36.