Enhanced interval trees for dynamic IP router-tables

IEEE Transactions on Computers

Volumn 53, Issue 12, 2004, Pages 1615-1628

  Lu, Haibin ^a   Sahni, Sartaj ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Dynamic rule tables; Highest priority matching; Interval trees; Longest prefix matching; Packet classification; Packet routing; Router tables; Rule insertion and deletion

Indexed keywords

CACHE MEMORY; DATA STRUCTURES; INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; ROUTERS; TABLE LOOKUP; THEOREM PROVING; TREES (MATHEMATICS);

DYNAMIC RULE-TABLES; HIGHEST PRIORITY MATCHING; INTERVAL TREES; LONGEST-PREFIX MATCHING; PACKET CLASSIFICATION; PACKET ROUTING;

DATA COMMUNICATION SYSTEMS;

EID: 11244316382     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2004.116     Document Type: Article

References (30)

1. C. Macian and R. Finthammer, "An Evaluation of the Key Design Criteria to Achieve High Update Rates in Packet Classifiers," IEEE Network pp. 24-29, Nov./Dec. 2001.
2. F. Baboescu, S. Singh, and G. Varghese, "Packet Classification for Core Routers: Is There an Alternative to Caros?" Proc. IEEE INFOCOM, 2003.
3. C. Labovitz, G. Malan, and F. Jahanian, "Internet Routing Instability," IEEE/ACM Trans. Networking, 1997.
4. M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, "Survey and Taxonomy of IP Address Lookup Algorithms," Network, vol. 15, no. 2, pp. 8-23, Mar./Apr. 2001
5. S. Sahni, K. Kim, and H. Lu, "Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching," Proc. Int'l Symp. Parallel Architectures, Algorithms, and Networks (ISPAN), May 2002.
6. A. McAuley and P. Francis, "Fast Routing Table Lookups Using Cams," Proc. IEEE INFOCOM, pp. 1382-1391, 1993.
7. D. Shah and P. Gupta, "Fast Updating Algorithms for Tcams," IEEE Micro, vol. 21, no. 1, pp. 36-47, 2001.
8. C. Matsumoto, "Cam Vendors Consider Algorithmic Alternatives," EETimes, May 2002.
9. K. Sklower, "A Tree-Based Routing Table for Berkeley Unix," technical report, Univ. of California, Berkeley, 1993.
10. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small Forwarding Tables for Fast Routing Lookups," Proc. ACM SIGCOMM, pp. 3-14, 1997.
11. W. Doeringer, G. Karjoth, and M. Nassehi, "Routing on Longest-Matching Prefixes," IEEE/ACM Trans. Networking, vol. 4, no. 1, pp. 86-97, 1996.
12. S. Nilsson and G. Karlsson, "Fast Address Look-Up for Internet Routers," IEEE Broadband Comm., 1998.
13. V. Srinivasan and G. Varghese, "Faster IP Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Systems, pp. 1-40, Feb. 1999.
14. S. Sahni and K. Kim, "Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup," Proc. Eighth IEEE Workshop Future Trends of Distributed Computing Systems, 2001.
15. S. Sahrd and K. Kim, "Efficient Construction of Variable-Stride Multibit Tries for IP Lookup," Proc. IEEE Symp. Applications and the Internet (SAINT), 2002.
16. P. Gupta, S. Lin, and N. McKeown, "Routing Lookups in Hardware at Memory Access Speeds," Proc. IEEE INFOCOM, 1998.
17. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable High Speed IP Routing Lookups," Proc. ACM SIGCOMM, pp. 25-36, 1997.
18. B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookup Using Multi-Way and Multicolumn Search," Proc. IEEE INFOCOM, 1998.
19. A. Basu and G. Narlika, "Fast Incremental Updates for Pipelined Forwarding Engines," Proc. IEEE INFOCOM, 2003.
20. S. Suri, G. Varghese, and P. Warkhede, "Multiway Range Trees: Scalable IP Lookup with Fast Updates," Proc. GLOBECOM, 2001.
21. S. Sahni and K. Kim, "O (log n) Dynamic Packet Routing," Proc. IEEE Symp. Computers and Comm., 2002.
22. S. Sahni and K. Kim, "Efficient Dynamic Lookup for Bursty Access Patterns," http://www.cise.ufl.edu/~sahni, 2003.
23. F. Ergun, S. Mittra, S. Sahinalp, J. Sharp, and R. Sinha, "A Dynamic Lookup Scheme for Bursty Access Patterns," Proc. IEEE INFOCOM, 2001.
24. H. Lu and S. Sahni, "O(log n) Dynamic Router-Tables for Prefixes and Ranges," Proc. IEEE Symp. Computers and Comm., 2003.
25. E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++. New York: W.H. Freeman, 1995.
26. P. Gupta and N. McKeown, "Dynamic Algorithms with Worst-Case Performance for Packet Classification," IFIP Networking, 2000.
27. T. Cormen, C. Lieserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001.
28. M.D. Berg, M.V. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Springer Verlag, 1997.
29. S. Sahni, Data Structures, Algorithms, and Applications in Java. New York: McGraw-Hill, 2000.
30. Merit, "IPMA Statistics," http://nic.merit.edu/ipma, 2000, 2001.