This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Prefix and Interval-Partitioned Dynamic IP Router-Tables
May 2005 (vol. 54 no. 5)
pp. 545-557
ASCII Text
x 
 
Haibin Lu, Kun Suk Kim, Sartaj Sahni, "Prefix and Interval-Partitioned Dynamic IP Router-Tables," IEEE Transactions on Computers, vol. 54, no. 5, pp. 545-557, May, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TC.2005.83,
author = {Haibin Lu and Kun Suk Kim and Sartaj Sahni},
title = {Prefix and Interval-Partitioned Dynamic IP Router-Tables},
journal ={IEEE Transactions on Computers},
volume = {54},
number = {5},
issn = {0018-9340},
year = {2005},
pages = {545-557},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.83},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Prefix and Interval-Partitioned Dynamic IP Router-Tables
IS - 5
SN - 0018-9340
SP545
EP557
EPD - 545-557
A1 - Haibin Lu,
A1 - Kun Suk Kim,
A1 - Sartaj Sahni,
PY - 2005
KW - Packet routing
KW - dynamic router-tables
KW - longest-prefix matching
KW - prefix partitioning
KW - interval partitioning.
VL - 54
JA - IEEE Transactions on Computers
ER -
 
Two schemes—prefix partitioning and interval partitioning—are proposed to improve the performance of dynamic IP router-table designs. While prefix partitioning applies to all known dynamic router-table designs, interval partitioning applies to the alternative collection of binary search tree designs of Sahni and Kim [18]. Experiments using public-domain IPv4 router databases indicate that one of the proposed prefix partitioning schemes—TLDP—results in router tables that require less memory than when prefix partitioning is not used. Further significant reduction in the time to find the longest matching-prefix, insert a prefix, and delete a prefix is achieved.

[1] F. Chang, W. Feng, and K. Li, “Approximate Caches for Packet Classification,” Proc. IEEE INFOCOM, 2004.
[2] F. Chang, W. Feng, W. Feng, and K. Li, “Efficient Packet Classification with Digest Caches,” Proc. Third Workshop Network Processors and Applications (NP3), 2004.
[3] M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, “Small Forwarding Tables for Fast Routing Lookups,” Proc. ACM SIGCOMM, pp. 3-14, 1997.
[4] W. Doeringer, G. Karjoth, and M. Nassehi, “Routing on Longest-Matching Prefixes,” IEEE/ACM Trans. Networking, vol. 4, no. 1, pp. 86-97, 1996.
[5] F. Ergun, S. Mittra, S. Sahinalp, J. Sharp, and R. Sinha, “A Dynamic Lookup Scheme for Bursty Access Patterns,” Proc. IEEE INFOCOM, 2001.
[6] P. Gupta and N. McKeown, “Dynamic Algorithms with Worst-Case Performance for Packet Classification,” Proc. IFIP Networking, 2000.
[7] E. Horowitz, S. Sahni, and D. Mehta, Fundamentals of Data Structures in C++. New York: W.H. Freeman, 1995.
[8] Merit, Ipma statistics, http://nic.merit.eduipma, 2001.
[9] B. Lampson, V. Srinivasan, and G. Varghese, “IP Lookup Using Multi-Way and Multicolumn Search,” Proc. IEEE INFOCOM, 1998.
[10] H. Lu and S. Sahni, “$O(\log n)$ Dynamic Router-Tables for Prefixes and Ranges,” IEEE Trans. Computers, vol. 53, no. 10, pp. 1217-1230, Oct. 2004.
[11] H. Lu and S. Sahni, “Enhanced Interval Trees for Dynamic IP Router-Tables,” IEEE Trans. Computers, vol. 53, no. 12, pp. 1615-1628, Dec. 2004.
[12] H. Lu and S. Sahni, “A B-Tree Dynamic Router-Table Design,” Proc. IEEE Symp. Computers and Comm., 2004.
[13] S. Nilsson and G. Karlsson, “Fast Address Look-Up for Internet Routers,” IEEE Broadband Comm., 1998.
[14] M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, “Survey and Taxonomy of IP Address Lookup Algorithms,” IEEE Network, pp. 8-23, 2001.
[15] 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.
[16] 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.
[17] S. Sahni and K. Kim, “$O(\log n)$ Dynamic Packet Routing,” Proc. IEEE Symp. Computers and Comm., 2002.
[18] S. Sahni and K. Kim, “Efficient Dynamic Lookup for Bursty Access Patterns,” Int'l J. foundations of Computer Science, vol. 15, no. 4, pp. 567-592, 2004.
[19] S. Sahni, Data structures, Algorithms, and Applications in Java. New York: McGraw Hill, 2000.
[20] 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), pp. 3-14, 2002.
[21] K. Sklower, “A Tree-Based Routing Table for Berkeley Unix,” technical report, Univ. of California, Berkeley, 1993.
[22] X. Sun, S. Sahni, and Y. Zhao, “Fast Update Algorithm for IP Forwarding Table Using Independent Sets,” Proc. IEEE Int'l Conf. High Speed Networks and Multimedia Comm., 2004.
[23] X. Sun, S. Sahni, and Y. Zhao, “Packet Classification Consuming Small Amount of Memory,” IEEE/ACM Trans. Networking, 2005.
[24] V. Srinivasan and G. Varghese, “Faster IP Lookups Using Controlled Prefix Expansion,” ACM Trans. Computer Systems, pp. 1-40, Feb. 1999.
[25] S. Suri, G. Varghese, and P. Warkhede, “Multiway Range Trees: Scalable IP Lookup with Fast Updates,” Proc. GLOBECOM, 2001.
[26] M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, “Scalable High Speed IP Routing Lookups,” Proc. ACM SIGCOMM, pp. 25-36, 1997.
[27] J. Xu, M. Singhal, and J. Degroat, “A Novel Cache-Architecture to Support Layer-Four Papcket Classification at Memopry Access Speeds,” Proc. IEEE INFOCOM, 2000.

Index Terms:
Packet routing, dynamic router-tables, longest-prefix matching, prefix partitioning, interval partitioning.
Citation:
Haibin Lu, Kun Suk Kim, Sartaj Sahni, "Prefix and Interval-Partitioned Dynamic IP Router-Tables," IEEE Transactions on Computers, vol. 54, no. 5, pp. 545-557, May 2005, doi:10.1109/TC.2005.83
Usage of this product signifies your acceptance of the Terms of Use.