An Evaluation of IP-Address Lookup Algorithms

Due to the manyfold increase in Internet traffic, backbone links and routers of multigigabit capacity are commonly deployed. One of the major bottlenecks in the optimum performance of such high-speed routers is address lookup while performing longest prefix match. The problem is further compounded by the introduction of 128 bit addresses in IPv6 technology. Due to the importance of the address lookup problem several algorithms have been proposed in recent years. This paper presents an evaluation of state-of-art IP address lookup algorithms. Both software and hardware based algorithms are discussed in terms of space/time complexity, lookup speed, scalability and update overheads

[1]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

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

[3]  Farnam Jahanian,et al.  Origins of Internet routing instability , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Antonius P. J. Engbersen,et al.  Fast and scalable packet classification , 2003, IEEE J. Sel. Areas Commun..

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

[6]  Jon Postel,et al.  Internet Protocol , 1981, RFC.

[7]  Mikhail J. Atallah,et al.  Adaptive data structures for IP lookups , 2005, JEAL.

[8]  T. V. Lakshman,et al.  Beyond best effort: router architectures for the differentiated services of tomorrow's Internet , 1998, IEEE Commun. Mag..

[9]  Henry H.-Y. Tzeng,et al.  On fast address-lookup algorithms , 1999, IEEE J. Sel. Areas Commun..

[10]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[11]  T. V. Lakshman,et al.  High-speed policy-based packet forwarding using efficient multi-dimensional range matching , 1998, SIGCOMM '98.

[12]  David E. Taylor.  Survey and taxonomy of packet classification techniques , 2005, CSUR.

[13]  Alfred Burton Marsh.  Matching algorithms. , 1979 .

[14]  Jürgen Falb,et al.  The Internet Protocol , 2005, The Industrial Information Technology Handbook.

[15]  Francis Zane,et al.  Coolcams: power-efficient TCAMs for forwarding engines , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Derek Chi-Wai Pao,et al.  Enabling incremental updates to LC-trie for efficient management of IP forwarding tables , 2003, IEEE Communications Letters.

[17]  Hyesook Lim,et al.  High speed IP address lookup architecture using hashing , 2003, IEEE Communications Letters.

[18]  Chia-Tai Chan,et al.  High-speed packet classification for differentiated services in next-generation networks , 2004, IEEE Transactions on Multimedia.

[19]  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).

[20]  Haoyu Song,et al.  Fast hash table lookup using extended bloom filter: an aid to network processing , 2005, SIGCOMM '05.

[21]  John W. Lockwood,et al.  Scalable IP lookup for Internet routers , 2003, IEEE J. Sel. Areas Commun..

[22]  Stefan Nilsson,et al.  An Experimental Study of Compression Methods for Dynamic Tries , 2002, Algorithmica.

[23]  Andrew J. T. Colin,et al.  The Implementation , 1972, Softw. Pract. Exp..

[24]  Vince Fuller,et al.  Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.

[25]  Keith Sklower,et al.  A Tree-Based Packet Routing Table for Berkeley Unix , 1991, USENIX Winter.

[26]  Srinivasan Keshav,et al.  Issues and trends in router design , 1998, IEEE Commun. Mag..

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

[28]  C. Zukowski,et al.  Putting routing tables in silicon , 1992, IEEE Network.

[29]  Victor C. M. Leung,et al.  A framework for optimizing the cost and performance of next-generation IP routers , 1999, IEEE J. Sel. Areas Commun..

[30]  George Varghese,et al.  Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.

[31]  Marcel Waldvogel,et al.  Fast longest prefix matching: algorithms, analysis, and applications , 2000 .

[32]  George Varghese,et al.  Packet classification for core routers: is there an alternative to CAMs? , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[33]  George Varghese,et al.  Scalable packet classification , 2001, SIGCOMM '01.

[34]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[35]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[36]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 1999, TNET.

[37]  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.

[38]  Raj Jain,et al.  A comparison of hashing schemes for address lookup in computer networks , 1992, IEEE Trans. Commun..

[39]  David Waitzman,et al.  A 50-Gb/s IP router , 1998, TNET.

[40]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[41]  Yakov Rekhter,et al.  An Architecture for IP Address Allocation with CIDR , 1993, RFC.

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

[43]  Arne Andersson,et al.  Efficient implementation of suffix trees , 1995, Softw. Pract. Exp..

[44]  Radia Perlman,et al.  Interconnections: Bridges, Routers, Switches, and Internetworking Protocols , 1999 .

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

[46]  Mikhail J. Atallah,et al.  Adaptive data structures for IP lookups , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[47]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 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.

[48]  Sarang Dharmapurikar,et al.  Longest prefix matching using bloom filters , 2006, IEEE/ACM Transactions on Networking.

[49]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.