Abstract
We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over five years, discovering what we call the middle-class effect. We exploit this effect for tailoring a simple solution to the IP lookup scheme, taking advantage of the skewed distribution of Internet addresses in routing tables. Our algorithmic solution is easy to implement as it is tantamount to performing an indirect memory access. Its performance can be bounded tightly and has very low memory dependence (e.g. just one memory access to off-chip memory in the hardware implementation). It can quickly handle route announcements and withdrawals on the fly, with a small cost which scales well with the number of routes. Concurrent access is permitted during these updates.
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
Aho, A.V., Sloane, N.J.A.: Some doubly exponential sequences. Fibonacci Quarterly, 429–437 (1973)
Aida, M., Abe, T.: Pseudo-address generation algorithm of packet destinations for internet performance simulation. In: IEEE INFOCOM, pp. 1425–1433 (2001)
Buchsbaum, A.L., Fowler, G.S., Kirishnamurthy, B., Vo, K.-P., Wang, J.: Fast prefix matching of bounded strings. J. Exp. Algorithmics 8, 1–3 (2003)
Crescenzi, P., Dardini, L., Grossi, R.: IP address lookup made fast and simple. In: Proce. 7th Annual European Symposium on Algorithms, pp. 65–76 (1999)
Deering, S., Hinden, R.: Internet protocol, version 6 (IPv6). RFC 1883 (1995)
Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.: Longest prefix matching using bloom filters. In: IEEE INFOCOM, pp. 201–212 (2003)
Eatherton, W., Varghese, G., Dittia, Z.: Tree bitmap: hardware/software IP lookups with incremental updates. SIGCOMM Comput. Commun. Rev. 34(2), 97–122 (2004)
Geraci, F., Grossi, R.: Distilling router data analysis for faster and simpler dynamic IP lookup algorithms. Tech. Report TR-05-01, Università di Pisa (January 2005)
Goodell, G., Aiello, W., Griffin, T., Ioannidis, J., McDaniel, P., Rubin, A.: Working around BGP: An incremental approach to improving security and accuracy of interdomain routing. In: Network and Distributed System Security Symposium (2003)
Labovitz, C., Jahanian, F., Johnson, S., Malan, R., Harris, S.R., Wan, J., Agrawal, M., Zhu, D., Ahuja, A., Poland, J.: Internet Performance Measurement and Analysis (IPMA) statistics (1999), http://www.merit.edu/ipma
Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. IEEE/ACM Transactions on Networking 7(3), 324–334 (1999)
Pellegrini, M., Fusco, G.: Efficient IP table lookup via adaptive stratified trees with selective reconstructions. In: 12th European Symp. on Algorithms, pp. 24–35 (2004)
Postel, J.: Internet protocol. RFC 791 (1981)
Network Coordination Centre of the Réseaux IP Européens (RIPE NCC). Routing information service project, Amsterdam router (2003), http://www.ripe.net/ris/index.html
Rizzo, L.: Personal communication (2003)
Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Network, 8–23 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geraci, F., Grossi, R. (2005). Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_50
Download citation
DOI: https://doi.org/10.1007/11427186_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)