New Data Structures for IP Lookup and Conflict Detection

In this paper we present a survey of new data structures for the representation of dynamic range router tables that employ most specific range matching. We present the min-augmented range tree with a relaxed balancing scheme, allowing updates and rebalancing tasks to be decoupled. Utilizing this scheme, IP lookups are not as much delayed as in a strict balancing scheme. Furthermore, we outline additional improvements to an existing online conflict detection approach, saving space and update costs. For offline conflict detection and resolution we describe an efficient sweepline algorithm.

[1]  Eljas Soisalon-Soininen,et al.  Relaxed Balanced Red-Black Trees , 1997, CIAC.

[2]  Tobias Langner,et al.  Versioning Tree Structures by Path-Merging , 2008, FAW.

[3]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[4]  Mikhail J. Atallah,et al.  Adaptive data structures for IP lookups , 2005, JEAL.

[5]  Giuseppe Cattaneo,et al.  Algorithm engineering , 1999, CSUR.

[6]  Sartaj Sahni,et al.  Conflict detection and resolution in two-dimensional prefix router tables , 2005, IEEE/ACM Transactions on Networking.

[7]  Ralf Hinze,et al.  A simple implementation technique for priority search queues , 2001, ICFP '01.

[8]  Haoyu Song,et al.  Shape shifting tries for faster IP route lookup , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[9]  Amitava Datta,et al.  A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[10]  Guru M. Parulkar,et al.  Detecting and resolving packet filter conflicts , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[12]  Sabine Hanke,et al.  The Performance of Concurrent Red-Black Tree Algorithms , 1998, WAE.

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

[14]  Thomas Ottmann,et al.  Relaxed min-augmented range trees for the representation of dynamic IP router tables , 2008, 2008 IEEE Symposium on Computers and Communications.

[15]  Sartaj Sahni,et al.  Recursively Partitioned Static IP Router Tables , 2007, IEEE Transactions on Computers.

[16]  Sartaj Sahni,et al.  Efficient Construction of Pipelined Multibit-Trie Router-Tables , 2007, IEEE Transactions on Computers.

[17]  Eljas Soisalon-Soininen,et al.  Relaxed Balancing Made Simple , 1995 .

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

[19]  Shi Ying,et al.  Frontiers in Algorithmics , 2010, Lecture Notes in Computer Science.

[20]  Herbert S. Wilf,et al.  Algorithms and Complexity , 2010, Lecture Notes in Computer Science.

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

[22]  Sartaj Sahni,et al.  Succinct Representation of Static Packet Classifiers , 2007, IEEE/ACM Transactions on Networking.

[23]  Yanghee Choi,et al.  A Simple and Scalable Algorithm for the IP Address Lookup Problem , 2003, Fundam. Informaticae.

[24]  Amitava Datta,et al.  Update-efficient Data Structures for Dynamic Ip Router Tables , 2007, Int. J. Found. Comput. Sci..

[25]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.