A fast and scalable IPv4 and 6 address lookup algorithm

Due to Internet's exponential growth in the last few years, we face two serious problems. First, the network becomes congested. Second, the number of IP addresses is not enough for distribution. For network congestion, we use fibers in the backbone of the networks to alleviate the bandwidth shortage problem. However, the networks are still congested at the routers. For the second problem, IPv6 expands the length of IP address from 32-bit in IPv4 to 128-bit. With such length, there will be no shortage of IP address. Therefore, the problem remained to be solved is a faster router. With 128-bit address, IP address lookup in the routing table will be an obvious problem. Slow IP address lookup will delay the packet forwarding in the router and degrade the network performance. In the paper, we will present a new and simple algorithm for accelerating the IP address lookup.

[1]  Gunnar Karlsson,et al.  Fast address look-up for internet routers , 1998, Broadband Communications.

[2]  Hyesook Lim,et al.  A new pipelined binary search architecture for IP address lookup , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[3]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[4]  Wen-Shyen E. Chen,et al.  A fast and scalable IP lookup scheme for high-speed networks , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

[5]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[6]  Günter Karjoth,et al.  Routing on longest-matching prefixes , 1996, TNET.

[7]  J. C. Liu,et al.  Modified LC-trie based efficient routing lookup , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[8]  Hyesook Lim,et al.  A parallel multiple hashing architecture for IP address lookup , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[9]  V. Srinivasan,et al.  Fast address lookups using controlled prefix expansion , 1999, TOCS.

[10]  Douglas E. Comer,et al.  Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition , 2000 .

[11]  Jong-Suk Ahn,et al.  Bit-map trie: a data structure for fast forwarding lookups , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[12]  Mehmet Toy,et al.  A trie-based algorithm for IP lookup problem , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[13]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[14]  Douglas Comer.  Internetworking With TCP/IP Principles , 1988 .

[15]  N. Yazdani,et al.  Fast and scalable schemes for the IP address lookup problem , 2000, ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485).

[16]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[17]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[18]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[19]  Stephen A. Thomas,et al.  IPng and the TCP/IP Protocols: Implementing the Next Generation Internet , 1996 .

[20]  Douglas E. Comer,et al.  Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition , 1988 .

[21]  George Varghese,et al.  Multiway range trees: scalable IP lookup with fast updates , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[22]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[23]  Gunnar Karlsson,et al.  IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..