A B-tree dynamic router-table design

IEEE Transactions on Computers

Volumn 54, Issue 7, 2005, Pages 813-824

  Lu, Haibin ^a   Sahni, Sartaj ^b  

^a University of Missouri   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

B trees; Dynamic router tables; Highest priority range matching; Longest prefix matching; Nonintersecting ranges; Packet routing

Indexed keywords

CACHE MEMORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ROUTERS; TABLE LOOKUP; TREES (MATHEMATICS);

B TREES; DYNAMIC ROUTER TABLES; HIGHEST PRIORITY RANGE MATCHING; LONGEST PREFIX MATCHING; NONINTERSECTING RANGES; PACKET ROUTING;

NETWORK PROTOCOLS;

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

References (21)

1. M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small Forwarding Tables for Fast Routing Lookups," Proc. ACM SIGCOMM, pp. 3-14, 1997.
2. W. Doeringer, G. Karjoth, and M. Nassehi, "Routing on Longest-Matching Prefixes," IEEE/ACM Trans. Networking, vol. 4, no. 1, pp. 86-97, 1996.
3. F. Ergun, S. Mittra, S. Sahinalp, J. Sharp, and R. Sinha, "A Dynamic Lookup Scheme for Bursty Access Patterns," Proc. IEEE INFOCOM 2001.
4. P. Gupta and N. McKeown, "Dynamic Algorithms with Worst-Case Performance for Packet Classification," Proc. IFIP Networking, 2000.
5. E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++. New York: W.H. Freeman, 1995.
6. Merit, Ipma statistics, http://nic.merit.edu/ipma, 2001.
7. B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookup Using Multi-Way and Multicolumn Search," Proc. IEEE INFOCOM '98, 1998.
8. H. Lu and S. Sahni, "O(logn) Dynamic Router-Tables for Prefixes and Ranges," IEEE Trans. Computers, vol. 53, no. 10, pp. 1217-1230, Oct. 2004.
9. H. Lu and S. Sahni, "Dynamic IP Router-Tables Using Highest-Priority Matching," Proc. IEEE Symp. Computers and Comm., 2004.
10. S. Nilsson and G. Karlsson, "Fast Address Look-Up for Internet Routers," IEEE Broadband Comm., 1998.
11. M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, "Survey and Taxonomy of IP Address Lookup Algorithms," IEEE Network, pp. 8-23, 2001.
12. 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.
13. S. Sahni and K. Kim, "Efficient Construction of Variable-Stride Multibit Tries for IP Lookup," Proc. IEEE Symp. Applications and the Internet (SAINT), pp. 220-227, 2002.
14. S. Sahni and K. Kim, "O(logn) Dynamic Packet Routing," Proc.. IEEE Symp. Computers and Comm., 2002.
15. S. Sahni and K. Kim, "Efficient Dynamic Lookup for Bursty Access Patterns," Int't J. Foundations of Computer Scince, vol. 15, no. 4, pp. 567-592, 2004.
16. S. Sahni, Data Structures, Algorithms, and Applications in Java, second ed. Silicon Press, 2005.
17. S. Sahni, K. Kim, and H. Lu, "Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching," Int'l J. Foundations of Computer Science, vol. 14, no. 3, pp. 337-358, 2003.
18. K. Sklower, "A Tree-Based Routing Table for Berkeley Unix," Technical Report, Univ. of California, Berkeley, 1993.
19. V. Srinivasan and G. Varghese, "Faster IP Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Systems, pp. 1-40, Feb. 1999.
20. P.R. Warkhede, S. Suri, and G. Varghese, "Multiway Range Trees: Scalable IP Lookup with Fast Updates," Computer Networks, vol. 44, no. 3, pp. 289-303, 2004.
21. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable High Speed IP Routing Lookups," Proc. ACM SIGCOMM, pp. 25-36, 1997.