Dynamic Tree Bitmap for IP Lookup and Update

We propose a data structure-dynamic tree bitmap-for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tree bitmap is able to support updates at the same rate as lookups and is very competitive with other structures-tree bitmap and BaRT-proposed earlier for dynamic tables. Although the dynamic tree bitmap requires more memory than is required by the tree bitmap and BaRT structures, the required memory remains reasonable. The real value of our structure is its ability to support a very high update rate.

[1]  Sartaj Sahni,et al.  Efficient construction of variable-stride multibit tries for IP lookup , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT 2002).

[2]  SuriSubhash,et al.  Multiway range trees , 2004 .

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

[4]  Pascal Lorenz,et al.  Proceedings of the 5th International Conference on Networking , 2006 .

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

[6]  Sartaj Sahni,et al.  Data Structures, Algorithms and Applications in Java , 1998 .

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

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

[9]  Devavrat Shah,et al.  Fast Updating Algorithms for TCAMs , 2001, IEEE Micro.

[10]  Jan van Lunteren.  Searching very large routing tables in wide embedded memory , 2001, GLOBECOM.

[11]  Sartaj Sahni,et al.  Efficient Dynamic Lookup For Bursty Access Patterns , 2004, Int. J. Found. Comput. Sci..

[12]  Sartaj Sahni,et al.  Data structures for one-dimensional packet classification using most-specific-rule matching , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[13]  George Varghese,et al.  Multiway range trees: scalable IP lookup with fast updates , 2004, Comput. Networks.

[14]  Girija J. Narlikar,et al.  Fast incremental updates for pipelined forwarding engines , 2005, IEEE/ACM Transactions on Networking.

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

[16]  Ellis Horowitz,et al.  Fundamentals of data structures in C , 1976 .

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

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

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

[20]  Nick McKeown,et al.  Dynamic Algorithms with Worst-Case Performance for Packet Classification , 2000, NETWORKING.

[21]  S. Sahni,et al.  O(log n) dynamic packet routing , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

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

[23]  Jan van Lunteren.  Searching very large routing tables in fast SRAM , 2001, ICCCN.

[24]  David Antoö.  Overview of Data Structures in IP Lookups , 2002 .

[25]  C. Macian,et al.  An evaluation of the key design criteria to achieve high update rates in packet classifiers , 2001, IEEE Netw..

[26]  Sartaj Sahni,et al.  Enhanced interval trees for dynamic IP router-tables , 2004, IEEE Transactions on Computers.

[27]  Paul Francis,et al.  Fast routing table lookup using CAMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[28]  Sartaj Sahni,et al.  Prefix and interval-partitioned dynamic IP router-tables , 2005, IEEE Transactions on Computers.

[29]  Lars-Åke Larzon,et al.  High-performance longest prefix matching supporting high-speed incremental updates and guaranteed compression , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[30]  Wei Lin,et al.  A TCAM Index Scheme for IP Address Lookup , 2006, 2006 First International Conference on Communications and Networking in China.

[31]  Funda Ergün,et al.  A dynamic lookup scheme for bursty access patterns , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[32]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[33]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

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

[35]  Sartaj Sahni,et al.  A B-tree dynamic router-table design , 2005, IEEE Transactions on Computers.

[36]  Haibin Lu,et al.  O(log n) dynamic router-tables for prefixes and ranges , 2004, IEEE Transactions on Computers.

[37]  George Varghese,et al.  Tree bitmap: hardware/software IP lookups with incremental updates , 2004, CCRV.

[38]  Sartaj Sahni,et al.  Efficient construction of fixed-stride multibit tries for IP lookup , 2001, Proceedings Eighth IEEE Workshop on Future Trends of Distributed Computing Systems. FTDCS 2001.