A Hash-based scalable IP lookup using bloom and fingerprint filters

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2009, Pages 264-273

  Yu, Heeyeol ^a   Mahapatra, Rabi ^b   Bhuyan, Laxmi ^a  

^a University of California Riverside   (United States)

^b Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASH SCHEME; HIGH-SPEED; IP LOOKUP; LOOKUPS; MEMORY BANKING; MEMORY EFFICIENT; OFF-CHIP; ON CHIPS; PERFECT MATCHES; POWER EFFICIENCY; QUERY OPERATIONS; ROUTING TABLE; WORST CASE;

BLOOMS (METAL); INTERNET PROTOCOLS; NETWORK ARCHITECTURE; TELECOMMUNICATION NETWORKS; TERMINOLOGY;

TABLE LOOKUP;

EID: 71949110590     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2009.5339676     Document Type: Conference Paper

References (29)

1. K. G. Coffman and A. M. Odlyzko, Internet growth: Is there a "Moore's Law" for data traffic?, Handbook of Massive Data Sets. New York, New York: Kluwer, 2002.
2. Mathew Gray, Internet Groth Summary. [Online]. Available: http://www.mit.edu/people/mkgray/net/internet-growth-summary.html
3. BGP Routing Tables Analysis Report. [Online]. Available: http://bgp.potaroo.net
4. V. Ravikumar and R. Mahapatra, "TCAM Architecture for IP Lookup using Prefix Properties," MICRO, IEEE, vol. 24, no. 2, pp. 60-69, 2004.
5. V. C. Ravikumar, R. N. Mahapatra, and L. N. Bhuyan, "EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup," IEEE Trans. Comput., vol. 54, no. 5, pp. 521-533, 2005.
6. W. Eatherton, G. Varghese, and Z. Dittia, "Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates," SIGCOMM Comput. Commun. Rev., vol. 34, no. 2, pp. 97-122, 2004.
7. A. Basu and G. Narlikar, "Fast Incremental Updates for Pipelined Forwarding Engines," IEEE/ACM Trans. Netw., vol. 13, 2005.
8. A. C. Snoeren, "Hash-based IP Traceback," in SIGCOMM '01.
9. S. Dharmapurikar, P. Krishnamurthy, and D. E. Taylor, "Longest Prefix Matching using Bloom Filters," in SIGCOMM '03.
10. T. S. Sarang Dharmapurikar, Praveen Krishnamurthy and J. Lockwood, "Deep Packet Inspection using Parallel Bloom Filters," in MICRO 37.
11. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast Hash Table Lookup using Extended Bloom Filter: An Aid to Network Processing," in SIGCOMM '05.
12. J. Hasan, S. Cadambi, V. Jakkula, and S. Chakradhar, "Chisel: A Storage-Efficient, Collision-free Hash-based Network Processing Architecture," in ISCA '06.
13. F. Bonomi, M. Mitzenmacher, R. Panigrah, S. Singh, and G. Varghese, "Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines," in SIGCOMM '06.
14. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
15. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, "The Bloomier Filter: an Efficient Data Structure for Static Support Lookup Tables," in SODA '04.
16. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small Forwarding Tables for Fast Routing Lookups," SIGCOMM Comput. Commun. Rev., vol. 27, no. 4, pp. 3-14, 1997.
17. CACTI. [Online]. Available: http://www.hpl.hp.co.uk/personal/ NormanJouppi/cacti5.html
18. D. E. Knuth, The Art of Computer Programming. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 1978.
19. J. T. Sailesh Kumar and P. Crowley, "Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking," in INFOCOM '08, 2008.
20. A. Kirsch and M. Mitzenmacher, "Simple summaries for hashing with choices," IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 218-231, 2008.
21. V. Srinivasan and G. Varghese, "Fast Address Lookups using Controlled Prefix Expansion," ACM Trans. Comput. Syst., vol. 17, no. 1, 1999.
22. A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Mathematics, vol. 1, no. 4, pp. 485-509, 2002.
23. Integrated Device Technology Inc. [Online]. Available: http://www.idt.com/products
24. H. Song, J. Turner, and S. Dharmapurikar, "Packet Classification Using Coarse-grained Tuple Spaces," in ANCS '06.
25. B. Agrawal and T. Sherwood, "Virtually Pipelined Network Memory," in MICRO 39, 2006.
26. T. Sherwood, G. Varghese, and B. Calder, "A Pipelined Memory Architecture for High Throughput Network Processors," in ISCA '03.
27. F. Baboescu, D. M. Tullsen, G. Rosu, and S. Singh, "A Tree Based Router Search Engine Architecture with Single Port Memories," in ISCA '05.
28. B. Agrawal and T. Sherwood, "Modeling TCAM Power for Next Generation Network Devices," in ISPASS '06, 2006.
29. RIPE Network Coordination Centre. [Online]. Available: http://www.ripe.net/projects/ris/rawdata.html