Abstract
Various schemes for high-performance IP address lookups have been proposed recently. Pre-computations are usually used by the special designed IP address lookup algorithms to improve the lookup speed and reduce the memory requirement. However, the disadvantage of the pre-computation based schemes is when a single prefix is added or deleted, the entire data structure may need to be rebuilt. Rebuilding the entire data structure seriously affects the lookup performance of a backbone router, and thus is not suitable for dynamic routing tables. In this paper, we develop a new dynamic routing table algorithm. The proposed data structure consists of a collection of balanced binary search trees. The search, insertion, and deletion operations can be finished in O(logN) time, where N is the number of prefixes in a routing table. Comparing with the best existing dynamic routing table algorithm, PBOB (Prefix Binary tree On Binary tree), our experiment results using the real routing tables show that the proposed scheme performs better than PBOB in terms of the lookup speed, insertion time, deletion time, and memory requirement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
BGP Routing Table Analysis Reports, http://bgp.potaroo.net/
Brodnik, A., Carlsson, S., Degermark, M., Pink, S.: Small Forwarding Tables for Fast Routing Lookups. In: Proc. of ACM SIGCOMM, September 1997, pp. 3–14 (1997)
Huang, N.F., Zhao, S.M., Pan, J.Y., Su, C.A.: A Fast IP Routing Lookup Scheme for Gigabit Switching Routers. In: Proc. of INFOCOM, March 1999, pp. 1429–1436 (1999)
Kim, K., Sahni, S.: An O(logn) Dynamic Router-Table Design. IEEE Transactions on Computers 53(3), 351–363 (2004)
Lampson, B., Srinivasan, V., Varghese, G.: IP Lookups Using Multiway and Multicolumn Search. IEEE/ACM Transactions on Networking 3(3), 324–334 (1999)
Lu, H., Sahni, S.: Enhanced Interval Tree for Dynamic IP Router-Tables. IEEE Transactions on Computers 53(12), 1615–1628 (2004)
Meng, X., Xu, Z., Zhang, B., Huston, G., Lu, S., Zhang, L.: IPv4 Address Allocation and the BGP Routing Table Evolution. In: Proc. of ACM SIGCOMM, January 2005, pp. 71–80 (2005)
Nilsson, S., Karlsson, G.: IP-Address Lookup Using LC-trie. IEEE Journal on selected Areas in Communications 17(6), 1083–1092 (1999)
Sklower, K.: A Tree-based Packet Routing Table for Berkeley Unix. In: Proc. of Winter Usenix Conference, pp. 93–99 (1991)
Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Network Magazine 15(2), 8–23 (2001)
Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable High-Speed IP Routing Lookups. In: Proc. of ACM SIGCOMM, September 1997, pp. 25–36 (1997)
Warkhede, P., Suri, S., Varghese, G.: Multiway Range Trees: Scalable IP Lookup with Fast Updates. The International Journal of Computer and Telecommunications Networking 44(3), 289–303 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, YK., Lin, YC. (2006). Dynamic Routing Tables Using Simple Balanced Search Trees. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_39
Download citation
DOI: https://doi.org/10.1007/11919568_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48563-6
Online ISBN: 978-3-540-48564-3
eBook Packages: Computer ScienceComputer Science (R0)