Abstract
In this paper we present a survey of new data structures for the representation of dynamic range router tables that employ most specific range matching. We present the min-augmented range tree with a relaxed balancing scheme, allowing updates and rebalancing tasks to be decoupled. Utilizing this scheme, IP lookups are not as much delayed as in a strict balancing scheme. Furthermore, we outline additional improvements to an existing online conflict detection approach, saving space and update costs. For offline conflict detection and resolution we describe an efficient sweepline algorithm.
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
McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257–276 (1985)
Lu, H., Sahni, S.: O(logn) dynamic router-tables for prefixes and ranges. IEEE Transanctions on Computers 53(10), 1217–1230 (2004)
Kim, K.S., Sahni, S.: Efficient construction of pipelined multibit-trie router-tables. IEEE Transactions on Computers 56(1), 32–43 (2007)
Song, H., Turner, J., Lockwood, J.: Shape shifting tries for faster IP route lookup. In: ICNP 2005: Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005), Washington, DC, USA, pp. 358–367. IEEE Computer Society, Los Alamitos (2005)
Ioannidis, I., Grama, A., Atallah, M.: Adaptive data structures for IP lookups. J. Exp. Algorithmics 10, Article No. 1.1 (2005)
Lu, W., Sahni, S.: Recursively partitioned static IP router-tables. In: 12th IEEE Symposium on Computers and Communications, pp. 437–442 (2007)
Srinivasan, V., Varghese, G.: Faster IP lookups using controlled prefix expansion. In: SIGMETRICS 1998/PERFORMANCE 1998: Proceedings of the 1998 ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, pp. 1–10. ACM Press, New York (1998)
Lu, W., Sahni, S.: Succinct representation of static packet classifiers. In: 12th IEEE Symposium on Computers and Communications, pp. 1119–1124 (2007)
Lee, I., Park, K., Choi, Y., Chung, S.K.: A simple and scalable algorithm for the IP address lookup problem. Fundamenta Informaticae 56(1,2), 181–190 (2003)
Lu, H., Sahni, S.: Enhanced interval trees for dynamic IP router-tables. IEEE Transactions on Computers 53(12), 1615–1628 (2004)
Warkhede, P., Suri, S., Varghese, G.: Multiway range trees: scalable IP lookup with fast updates. Computer Networks 44(3), 289–303 (2004)
Hari, A., Suri, S., Parulkar, G.: Detecting and resolving packet filter conflicts. In: INFOCOM 2000: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1203–1212. IEEE Press, Los Alamitos (2000)
Lu, H., Sahni, S.: Conflict detection and resolution in two-dimensional prefix router tables. IEEE/ACM Transactions on Networking 13(6), 1353–1363 (2005)
Lauer, T., Ottmann, T., Datta, A.: Update-efficient data structures for dynamic IP router tables. International Journal of Foundations of Computer Science 18(1), 139–161 (2007)
Hinze, R.: A simple implementation technique for priority search queues. In: International Conference on Functional Programming, pp. 110–121 (2001)
Hanke, S.: The performance of concurrent red-black tree algorithms. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 286–300. Springer, Heidelberg (1999)
Maindorfer, C., Bär, B., Ottmann, T.: Relaxed min-augmented range trees for the representation of dynamic IP router tables. In: 13th IEEE Symposium on Computers and Communications, pp. 920–927 (2008)
Ottmann, T., Soisalon-Soininen, E.: Relaxed balancing made simple. Technical Report 71, Institut für Informatik, Albert-Ludwigs-Universität Freiburg (1995)
Hanke, S., Ottmann, T., Soisalon-Soininen, E.: Relaxed balanced red-black trees. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 193–204. Springer, Heidelberg (1997)
Maindorfer, C., Mohamed, K.A., Ottmann, T., Datta, A.: A new output-sensitive algorithm to detect and resolve conflicts in Internet router tables. In: INFOCOM 2007. 26th IEEE Conference on Computer Communications, pp. 2431–2435 (2007)
Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. In: STOC 1986: Proceedings of the eighteenth annual ACM symposium on Theory of computing, pp. 109–121. ACM Press, New York (1986)
Mohamed, K.A., Langner, T., Ottmann, T.: Versioning tree structures by path-merging. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 101–112. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Maindorfer, C., Lauer, T., Ottmann, T. (2009). New Data Structures for IP Lookup and Conflict Detection. In: Lerner, J., Wagner, D., Zweig, K.A. (eds) Algorithmics of Large and Complex Networks. Lecture Notes in Computer Science, vol 5515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02094-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-02094-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02093-3
Online ISBN: 978-3-642-02094-0
eBook Packages: Computer ScienceComputer Science (R0)