O(log n) dynamic packet routing

A data structure is developed that permits one to find longest matching prefixes as well as to insert and delete a prefix in O(log n) time, where n is the number of prefixes in the router table. Experimental results using a real IPv4 routing database are also presented.

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

[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]  Gunnar Karlsson,et al.  Fast address look-up for internet routers , 1998, Broadband Communications.

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

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

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

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

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

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

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

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

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