An efficient hardware-based multi-hash scheme for high speed IP lookup

Proceedings - Symposium on the High Performance Interconnects, Hot Interconnects

Volumn , Issue , 2008, Pages 103-110

  Demetriades, Socrates ^a   Hanna, Michel ^a   Cho, Sangyeun ^a   Melhem, Rami ^a  

^a Learning Research and Development Ctr

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; HASH SCHEMES; HASHING TECHNIQUES; HIGH SPEEDS; INTERNET ROUTERS; IP LOOKUPS; KEY DESIGN PARAMETERS; LOOK-UP TABLES; MULTIPLE HASHES; POWER REQUIREMENTS; ROUTING TABLES; STORAGE EFFICIENCIES;

INTERNET PROTOCOLS; LOGIC GATES; TELECOMMUNICATION NETWORKS; TERMINOLOGY;

TABLE LOOKUP;

EID: 57849167541     PISSN: 15504794     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HOTI.2008.27     Document Type: Conference Paper

References (24)

1. A. Gallo, "Meeting traffic demands with next-generation Internet infrastructure." Lightwave, 2001.
2. I. D. T. Inc. http://www.idt.com/products/.
3. N. microsystems. http://www.netlogicmicro.com.
4. M. Technology. http://www.micron.com.
5. W. Eatherton et al. "Tree bitmap: Hardware/software ip lookups with incremental updates," ACM SIGCOMM Computer Communications Review, 34(2), 2004.
6. L. Devroye, "Efficient construction of multibit tries for ip lookup," IEEE/ACM Transactions on Networking (TON), vol. 11, pp. 650-662, August 2003.
7. V. Srinivasan and G. Varghese, "Faster ip lookups using controlled prefix expansion," pp. 1-10, ACM SIGMETRICS, June 1998.
8. V. J. J. Hasan, S. Cadambi and S. Chakradhar, "Chisel: A storage-efficient, collision-free hash-based network processing architecture," pp. 203-215, IEEE ISCA, June 2006.
9. S. Kaxiras and G. Keramidas, "Ipstash: A set-associative memory approach for efficient ip-lookup," pp. 992-1001, IEEE Infocom, 2005.
10. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed ip routing lookups," pp. 25-37, ACM SIGCOMM, September 1997.
11. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast hash table lookup using extended bloom filter: An aid to network processing," pp. 181-192, ACM Sigcomm, August 2005.
12. S. Dharmapurikar, P. Krishnamurthy, and D. E. Taylor, "Longest prefix matching using bloom filters" ACM Sigcomm, August 2005.
13. R. Pagh and F. F. Rodler, "Cuckoo hashing " Lecture Notes in Computer Science, vol. 2161, pp. 121-133, 2001.
14. S. Kaxiras and G. Keramidas, "Ipstash: A power-efficient memory architecture for ip-lookup " pp. 361-373, IEEE Micro, November 2003.
15. A. Z. Broder and A. R. Karlin, "Multilevel adaptive hashing," in Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 43-53, 1990.
16. S. Cho, J. Martin, R. Xu, M. Hammoud, and R. Melhem, "Ca-ram: A high-performance memory substrate for search-intensive applications," pp. 230-241, IEEE ISPASS, April 2007.
17. R. Jain, "A Comparison of Hashing Schemes for Address Lookup in Computer Networks," pp. 1570-1573, IEEE Transactions on Communications, 1992.
18. A. Broder and M. Mitzenmacher, "Using multiple hash functions to improve ip lookups," pp. 1454-1463, IEEE Infocom, 2001.
19. M. M. A. Kirsch, "The power of one move: Hashing schemes for hardware," IEEE Infocom, 2008.
20. RIS, "Routing information service." http://www.ripe.net/ris/, 2006.
21. G. Huston, "Analyzing the internet's bgp routing table," The Internet Protocol Journal, vol. 4, 2001.
22. J F. Morishita et al. "A 312-MHz 16-Mb Random-Cycle Embedded DRAM Macro With a Power-Down Data Retention Mode for Mobile Applications," IEEE J. Solid-State Circuits, Jan. 2005.
23. H. Noda, K. Inoue, H. J. Mattausch, T. Koide, and K. Arimoto. "A Cost-Efficient Dynamic Ternary CAM in 130nm CMOS Technology with Planar Complementary Capacitors and TSR Architecture," Proc. Int'l Symp. VLSI Circuits, June 2003.
24. H. Noda et al. "A Cost-Efficient High-Performance Dynamic TCAM With Pipelined Hierarchical Searching and Shift Redundancy Architecture," IEEE J. Solid-State Circuits, 40(1): 245-253, Jan. 2005.