Prefix- and interval-partitioned router-tables [IP routing]

Two schemes - prefix partition and interval partition - are proposed to improve the performance of router-table design. Significant reduction in the time to find the longest matching-prefix, insert a prefix, and delete a prefix is achieved.

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

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

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

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

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

[6]  Sartaj Sahni,et al.  An O(logn) dynamic router-table design , 2004, IEEE Transactions on Computers.

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

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

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

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

[11]  Sartaj Sahni,et al.  Dynamic IP router-tables using highest-priority matching , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

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

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

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

[15]  Sartaj Sahni,et al.  A B-tree dynamic router-table design , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

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

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

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

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