An O(log n) dynamic router-table design

IEEE Transactions on Computers

Volumn 53, Issue 3, 2004, Pages 351-363

  Sahni, Sartaj ^a   Kim, Kun Suk ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Longest matching prefix; Packet routing; Red black trees

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DATABASE SYSTEMS; OPTIMIZATION; PACKET SWITCHING; PROGRAM COMPILERS; ROUTERS; TABLE LOOKUP;

BINARY SEARCH TREES; LONGEST MATCHING PREFIX; PACKET ROUTING; RED BLACK TREES;

INTERNET;

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

References (20)

1. A. Bremler-Barr, Y. Afek, and S. Har-Peled, "Routing with a Clue," Proc. ACM SIGCOMM, pp. 203-214, 1999.
2. G. Chandranmenon and G. Varghese, "Trading Packet Headers for Packet Processing," IEEE Trans. Networking, 1996.
3. G. Cheung and S. McCanne, "Optimal Routing Table Design for IP Address Lookups under Memory Constraints," Proc. IEEE INFOCOM, 1999.
4. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small Forwarding Tables for Fast Routing Lookups," Proc. ACM SIGCOMM, pp. 3-14, 1997.
5. W. Doeringer, G. Karjoth, and M. Nassehi, "Routing on Longest-Matching Prefixes," IEEE/ACM Trans. Networking, vol. 4, no. 1, pp. 86-97, 1996.
6. F. Ergun, S. Mittra, S. Sahinalp, J. Sharp, and R. Sinha, "A Dynamic Lookup Scheme for Bursty Access Patterns," Proc. IEEE INFOCOM, 2001.
7. P. Gupta and N. McKeown, "Dynamic Algorithms with Worst-Case Performance for Packet Classification," IFIP Networking, 2000
8. E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++. New York: W.H. Freeman, 1995.
9. B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookup Using Multi-Way and Multicolumn Search," Proc. IEEE INFOCOM, 1998.
10. A. McAuley and P. Francis, "Fast Routing Table Lookups Using CAMs," Proc. IEEE INFOCOM, pp. 1382-1391, 1993.
11. Merit, Ipma Statistics, http://nic.merit.edu/ipma, 2000.
12. P. Newman, G. Minshall, and L. Huston, "IP Switching and Gigabit Routers," IEEE Comm. Magazine, Jan. 1997.
13. S. Nilsson and G. Karlsson, "Fast Address Look-Up for Internet Routers," IEEE Broadband Comm., 1998.
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, pp. 178-184, 2001.
15. S. Sahni and K. Kim, "Efficient Construction of Variable-Stride Multibit Tries for IP Lookup," Proc. IEEE Symp. Applications and the Internet (SAINT), 2002.
16. S. Sahni and K. Kim, "Efficient Dynamic Lookup for Bursty Access Patterns," in preparation.
17. K. Sklower, "A Tree-Based Routing Table for Berkeley Unix," technical report, Univ. of California, Berkeley, 1993.
18. V. Srinivasan and G. Varghese, "Faster IP Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Systems, pp. 1-40, Feb. 1999.
19. S. Suri, G. Vargjese, and P. Warkhede, "Multiway Range Trees: Scalable IP Lookup with Fast Updates," Proc. GLOBECOM, 2001.
20. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable High Speed IP Routing Lookups," Proc. ACM SIGCOMM, pp. 25-36, 1997.