Dynamic IP router-tables using highest-priority matching

We develop a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. We also develop two modified version of BOB - PBOB (prefix BOB) for the case when all rule filters are prefixes and LMPBOB (longest matching-prefix BOB) when all rule filters are prefixes and longest-prefix matching is to be done. On practical n-rule router table, BOB, PBOB and LMPBOB perform search, insert and delete In O(log n) time and with O(log n) cache misses. Experimental results also are presented.

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

[2]  Sartaj Sahni,et al.  Data structures for dynamic router table , 2003 .

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

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

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

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

[7]  Sartaj Sahni.  Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching , 2002, COCOON.

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

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

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

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

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

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

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

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

[16]  Sartaj Sahni,et al.  O(log n) Dynamic Router-Tables for Prefixes and Ranges , 2004, IEEE Trans. Computers.

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

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

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

[20]  Girija J. Narlikar,et al.  Fast incremental updates for pipelined forwarding engines , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

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

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

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

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

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

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