Abstract
Tree-based algorithms, such as Patricia, LC-trie, LPFST, etc, are widely used to do longest prefix matching (LPM). These algorithms use all the bits of the prefix to build the tree and the bits are used from the most significant bit to the least significant bit sequentially. Thus the tree is not balanced and the tree depth is high. In this paper, we propose bit selection tree (BS-tree) to do LPM. The bits of the prefix are selected to build BS-tree based on their costs defined in this paper. BS-tree has lower tree depth and is more balanced compared to other tree-based schemes. BS-tree has good scalability to the length of the IP address and is suitable for both IPv4 and IPv6. We evaluate the performances of BS-tree using both IPv4 and IPv6, and specially refine it for IPv6 based on the observations on IPv6 address and real IPv6 routing tables.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Deering, S., Hinden, R.: Internet protocol version 6 specification. RFC2460 (December 1998)
Fink, R., Hinden, R.: 6bone (IPv6 testing address allocation) phaseout. RFC3701 (March 2004)
Ruiz-Sbnches, M., Biersack, E., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Network 15(2), 8–23 (2001)
Sklower, K.: A tree-based packet routing table for Berkeley Unix. In: 1991 Winter USENIX Conf., pp. 93–99 (1991)
Gupta, P., Lin, S., McKeown, N.: Routing lookups in hardware at memory access speed. In: IEEE INFOCOM, pp. 1240–1247 (1998)
Nilsson, S., Karlsson, G.: IP-address lookup using LC-tries. IEEE JSAS 17(6), 1083–1092 (1999)
Eatherton, W., Dittia, Z., Varghese, G.: Tree bitmap: hardware/ software IP lookups with incremental updates. ACM SIGCOMM Computer Communication Review 34(2), 97–122 (2004)
Li, Z., Ma, Y.: Trie-based observations on the routing tables. In: Japan-China Joint Workshop on Frontier of Computer Science and Technology, pp. 157–163 (November 2006)
Srinivasan, V., Varghese, G.: Fast address lookups using controlled prefix expansion. ACM Sigmetrics, 1–11 (June 1998)
Wuu, L., Chen, K., Liu, T.: A longest prefix first search tree for IP lookup. IEEE ICC, 989–993 (May 2005)
Woo, T.Y.C.: A modular approach to packet classification: algorithms and results. In: IEEE INFOCOM, pp. 1213–1222 (March 2000)
Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. In: IEEE INFOCOM, pp. 1248–1256 (March 1998)
Zheng, K., Liu, B.: V6Gene: a scalable IPv6 prefix generator for route lookup algorithm benchmark. In: IEEE AINA, pp. 147–152 (April 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Z., Zheng, D., Ma, Y. (2007). Using Bit Selection to Do Routing Table Lookup. In: Preparata, F.P., Fang, Q. (eds) Frontiers in Algorithmics. FAW 2007. Lecture Notes in Computer Science, vol 4613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73814-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-73814-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73813-8
Online ISBN: 978-3-540-73814-5
eBook Packages: Computer ScienceComputer Science (R0)