Efficient Construction of Pipelined Multibit-Trie Router-Tables

Efficient algorithms to construct multibit tries suitable for pipelined router-table applications are developed. We first enhance the 1-phase algorithm of Basu and Narlikar, obtaining a 1-phase algorithm that is 2.5 to 3 times as fast. Next, we develop 2-phase algorithms that not only guarantee to minimize the maximum per-stage memory but also guarantee to use the least total memory subject to the former constraint. Our 2-phase algorithms not only generate better pipelined trees than those generated by the 1-phase algorithm, but they also take much less time. A node pull-up scheme that guarantees no increase in maximum per-stage memory as well as a partitioning heuristic that generates pipelined multibit tries requiring less maximum per-stage memory than required by the tries obtained using the 1-phase and 2-phase algorithms are also proposed

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

[2]  Steven McCanne,et al.  Optimal routing table design for IP address lookups under memory constraints , 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).

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

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

[5]  Donald B. Johnson,et al.  Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures , 1983, J. Algorithms.

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

[7]  Ellis Horowitz,et al.  Computer Algorithms / C++ , 2007 .

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

[9]  Sartaj Sahni,et al.  Optimal folding of standard and custom cells , 1996, TODE.

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

[11]  Sartaj Sahni,et al.  Efficient construction of multibit tries for IP lookup , 2003, TNET.

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

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

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

[15]  Peter Newman,et al.  IP switching and gigabit routers , 1997, IEEE Commun. Mag..

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

[17]  Sartaj Sahni,et al.  IP Lookup by Binary Search on Prefix Length , 2002, J. Interconnect. Networks.

[18]  Greg N. Frederickson,et al.  Optimal Parametric Search Algorithms in Trees I: Tree Partitioning , 1992 .

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

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

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

[22]  Greg N. Frederickson,et al.  Optimal algorithms for tree partitioning , 1991, SODA '91.

[23]  Donald B. Johnson,et al.  Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..

[24]  Sartaj Sahni,et al.  (log n) dynamic router-tables for ranges , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[25]  George Varghese,et al.  Trading packet headers for packet processing , 1995, SIGCOMM '95.

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

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

[28]  Sariel Har-Peled,et al.  Routing with a clue , 1999, SIGCOMM '99.

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