Abstract
IP address lookup is a critical operation for high bandwidth routers in packet switching networks such as Internet. The lookup is a non-trivial operation since it requires searching for the longest prefix, among those stored in a (large) given table, matching the IP address. Ever increasing routing tables size, traffic volume and links speed demand new and more efficient algorithms. Moreover, the imminent move to IPv6 128-bit addresses will soon require a rethinking of previous technical choices. This article describes a the new data structure for solving the IP table look up problem christened the Adaptive Stratified Tree (AST). The proposed solution is based on casting the problem in geometric terms and on repeated application of efficient local geometric optimization routines. Experiments with this approach have shown that in terms of storage, query time and update time the AST is at a par with state of the art algorithms based on data compression or string manipulations (and often it is better on some of the measured quantities).
Work partially supported by the Italian Registry of ccTLD .it.
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
McKeown, N.: Hot interconnects tutorial slides. Stanford University, available at http://klamath.stanford.edu/talks/ (1999)
Suri, S., Varghese, G., Warkhede, P.: Multiwayrange trees: Scalable ip lookup with fast updates. Technical Report 99-28, Washington Universityin St. Luis,Dept. of Computer Science (1999)
Lampson, B.W., Srinivasan, V., Varghese, G.: IP lookups using multiwayand multicolumn search. IEEE/ACM Transactions on Networking 7, 324–334 (1999)
Feldmann, A., Muthukrishnan, S.: Tradeoffs for packet classification. In: Proceedings of INFOCOM, vol. 3, pp. 1193–1202. IEEE, Los Alamitos (2000)
Thorup, M.: Space efficient dynamic stabbing with fast queries. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, pp. 649–658. ACM, New York (2003)
Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic rectangular intersection with priorities. In: Proceedings of the thirty-fifth ACM symposium on Theory of computing, pp. 639–648. ACM Press, New York (2003)
Buchsbaum, A.L., Fowler, G.S., Krishnamurthy, B., Vo, K.P., Wang, J.: Fast prefix matching of bounded strings. In: Proceedings of Alenex 2003 (2003)
Cheung, G., McCanne, S.: Optimal routing table design for IP address lookups under memory constraints. In: INFOCOM, vol. (3), pp. 1437–1444 (1999)
Gupta, P., Prabhakar, B., Boyd, S.P.: Near optimal routing lookups with bounded worst case performance. In: INFOCOM, vol. (3), pp. 1184–1192 (2000)
Srinivasan, V., Varghese, G.: Fast address lookups using controlled prefix expansion. ACM Transactions on Computer Systems, 1–40 (1999)
Ioannidis, I., Grama, A., Atallah, M.: Adaptive data structures for ip lookups. In: INFOCOM 2003 (2003)
Pellegrini, M., Fusco, G., Vecchiocattivi, G.: Adaptive stratified search trees for ip table lookup. Technical Report TR IIT 22/2002, Istituto di Informatica e Telematica del CNR (IIT-CNR), Pisa, Italy (2002)
Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small forwarding tables for fast routing lookups. In: SIGCOMM, pp. 3–14 (1997)
Crescenzi, P., Dardini, L., Grossi, R.: IP address lookup made fast and simple. In: European Symposium on Algorithms, pp. 65–76 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pellegrini, M., Fusco, G. (2004). Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive