On designing fast nonuniformly distributed ip address lookup hashing algorithms

IEEE/ACM Transactions on Networking

Volumn 17, Issue 6, 2009, Pages 1916-1925

  Martinez, Christopher J ^a   Pandya, Devang K ^b   Lin, Wei Ming ^c  

^a UNIVERSITY OF NEW HAVEN   (United States)

^b Dibon Solutions Inc   (United States)

^c University of Texas at San Antonio   (United States)

Author keywords

Hashing algorithm; IP address lookup; Nonuniform distribution

Indexed keywords

HASHING ALGORITHMS; HASHING TECHNIQUES; HIGH THROUGHPUT; IP ADDRESS LOOKUP; IP ADDRESSS; NETWORK ALGORITHMS; NON-UNIFORM DISTRIBUTION; NONUNIFORMITY; PRE-PROCESSING METHOD; SIMULATION RESULT; XOR OPERATION;

INTERNET PROTOCOLS; NETWORK PERFORMANCE; SYSTEMS ENGINEERING;

ALGORITHMS;

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

References (22)

1. O. Amble and D. E. Knuth, "Ordered hash tables," Comput. J., vol.17, no.2, pp. 135-142, 1974.
2. A. Broder and M. Mitzenmacher, "Using multiple hash functions to improve IP lookups," in Proc. IEEE INFOCOM, 2001, pp. 1454-1463.
3. W. E. Burr, "Cryptographic hash standards: Where do we go from here?," IEEE Security Privacy, vol.4, no.2, pp. 88-91, Mar.-Apr. 2006.
4. S.-H. Chung, J. Sungkee, H. Yoon, and J.-W. Cho, "A fast and updat-able IP address lookup scheme," in Proc. ICCNMC, 2001, p. 419.
5. R. Jain, "A comparison of hashing schemes for address lookup in computer networks," IEEE Trans. Commun., vol.40, no.10, pp. 1570-1573, Oct. 1992.
6. D. E. Knuth, The Art of Computer Programming, 2nd ed. Reading, MA: Addison-Wesley, 1998, vol.3, Sorting and Searching.
7. C. Martinez, W.-M. Lin, and P. Patel, "Optimal XOR hashing for a linearly distributed address lookup in computer networks," in Proc. Symp. Arch. Netw. Commun. Syst., Princeton, NJ, Oct. 2005, pp. 203-210.
8. C. Martinez and W.-M. Lin, "Adaptive hashing technique forIPaddress lookup in computer networks," in Proc. 14th IEEE ICON, Singapore, Sep. 2006, pp. 1-6.
9. A. Moestedt and P. Sjodin, "IP address lookup in hardware for highspeed routing," inProc. IEEE Hot Interconnects6 Symp., Stanford, CA, Aug. 1998, pp. 31-39.
10. P. Newman, G. Minshall, T. Lyon, and L. Hutson, "IP switching and gigabit routers," IEEE Commun. Mag., vol.35, no.1, pp. 64-69, Jan. 1997.
11. X. Nie, D. J. Wilson, J. Cornet, G. Damm, and Y. Zhoa, "IP address lookup using a dynamic hash function," in Proc. IEEE Elect. Comput. Eng., Canadian Conf., May 2005, pp. 1646-1651.
12. S. Nilsson and G. Karlsson, "IP-address lookup using LC-tries," IEEE J. Sel. Areas Commun., vol.17, no.6, pp. 1083-1092, Jun. 1999.
13. D. Pao, C. Liu, L. Yeung, and K. S. Chan, "Efficient hardware architecture for fast IP address lookup," in Proc. IEEE INFOCOM, 2002, pp. 555-561.
14. M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Netw., vol.15, no.2, pp. 8-23, Mar./Apr. 2001.
15. A. Satoh and T. Inoue, "ASIC hardware focused comparison for hash functions MD5, RIPEMD-160, and SHS," in Proc. Int. Conf. Inf. Technol., Coding Comput., Jun. 2005, pp. 90-94.
16. R. Sedgewick, Algorithms. Reading, MA: Addison-Wesley, 1988.
17. V. Srinivasan and G. Varghese, "Faster IP lookups using controlled prefix expansion," in Proc. SIGMETRICS, Madison, WI, 1998, pp. 1-10.
18. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing lookups," in Proc. ACM SIGCOMM, Sep. 1999, pp. 25-35.
19. G. B. White and M. I. Huson, "A peer-based hardware protocol for intrusion detection systems," in Proc. MILCOM, 1996, pp. 468-472.
20. P. A. Yilmaz, A. Belenkiy, N. Uzun, N. Gogate, and M. Toy, "A trie-based algorithm for IP lookup problem," in Proc. IEEE Globecom, 2000, pp. 593-598.
21. D. Yu, B. Smith, and B. Wei, "Forwarding engine for fast routing lookups and updates," in Proc. IEEE Globecom, 1999, pp. 1556-1564.
22. PeerGuaridan 2, Phoenixlabs, 2007 [Online]. Available: http://phoenixlabs.org/pg2/