Skip to main content
SpringerLink
Log in

You Can Get There from Here: Routing in the Internet

  • Conference paper
Combinatorial and Algorithmic Aspects of Networking (CAAN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3405))

Included in the following conference series:

  • 549 Accesses

Abstract

Routing in the Internet is performed with the help of IP forwarding lookup tables; however, searching these tables efficiently for the “next hop” is nontrivial, and complex data structures make an important contribution in this regard. This article surveys the three main approaches to the problem and investigates the associated data structures and algorithms. We also explore variations on these approaches and conclude with a discussion of current trends.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chan, C.-T., Wang, P.-C., Hu, S.-C., Lee, C.-L., Chen, R.-C.: High performance IP forwarding with efficient routing–table update. Computer Comm. 26, 1681–1692 (2003)

    Article  Google Scholar 

  2. Degermark, M., Brodnick, A., Carlesson, S., Pink, S.: Small forwarding tables for fast routing lookups. In: Proceedings of ACM SIGCOMM, pp. 3–14 (1997)

    Google Scholar 

  3. Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.: Longest prefix matching using Bloom filters. In: Proceedings of SIGCOMM (2003)

    Google Scholar 

  4. Donnelly, A., Deegan, T.: IP router lookups as string matching. In: Proceedings of IEEE Local Computer Networks, LCN (2000)

    Google Scholar 

  5. Eatherton, W., Varghese, G., Dittia, Z.: Tree bitmap: Hardware/sofware IP lookups with incremental updates. Computer Comm. Review 34, 97–122 (2004)

    Article  Google Scholar 

  6. Ioannidis, I., Grama, A., Atallah, M.: Adaptive data structures for IP lookups. In: Proceedings of IEEE INFOCOM (2003)

    Google Scholar 

  7. Kim, B.-Y., Choi, Y.-H.: A pipelined routing lookup scheme with fast updates. Computer Comm. 26, 1594–1601 (2003)

    Article  Google Scholar 

  8. Knuth, D.E.: The Art of Computer Programming, vol. III. Addison Wesley, Reading (1973)

    Google Scholar 

  9. Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. In: Proceedings of IEEE INFOCOM (1998)

    Google Scholar 

  10. Liang, Z., Xu, K., Wu, J.: A scalable parallel lookup framework avoiding longest prefix match. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 616–625. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Lim, H., Seo, J.-H., Jung, Y.-J.: High speed IP address lookup architecture using hashing. IEEE Comm. Letters 7, 502–504 (2003)

    Article  Google Scholar 

  12. Mahramian, M., Yazdani, N., Faez, K., Taheri, H.: Neural network based algorithms for IP lookup and packet classification. In: Shafazand, H., Tjoa, A.M. (eds.) EurAsia-ICT 2002. LNCS, vol. 2510, pp. 204–211. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Nilsson, S., Karlsson, G.: Fast address lookup for Internet routers. In: Proceedings of IEEE Broadband Communications (1998)

    Google Scholar 

  14. Pellegrini, M., Fusco, G.: Efficient IP table lookup via adaptive stratified trees with selective reconstructions. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 772–783. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Pao, D., Li, Y.-K.: Enabling incremental updates to LC–trie for efficient management of IP forwarding tables. IEEE Comm. Letters 7, 245–247 (2003)

    Article  Google Scholar 

  16. Ruiz–Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Network, 8–23 (March/April 2001)

    Google Scholar 

  17. Sahni, S., Kim, K.S.: An O(log n) dynamic router–table design. IEEE Trans. on Computers 53, 351–363 (2004)

    Article  Google Scholar 

  18. Sundström, M., Larzon, L.-A.: High performance longest prefix matching supporting high–speed incremental updates and guaranteed compression. In: Proceedings of INFOCOM (2005)

    Google Scholar 

  19. Varghese, G.: Network Algorithmics. Elsevier, Amsterdam (2005)

    MATH  Google Scholar 

  20. Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable high–speed IP routing lookups. ACM Transactions on Computer Systems 19, 440–482 (2001)

    Article  Google Scholar 

  21. Warkhede, P., Suri, S., Varghese, G.: Multiway range trees: scalable IP lookup with fast updates. Computer Networks 44, 289–303 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut International des Télécommunications, 800 de la Gauchetière Ouest, Bureau 6700, Montréal, Québec, H5A 1K6, Canada

    Jean-Charles Grégoire

  2. Institut National de la Recherche Scientifique–Énergie, Matériaux,et Télécommunications, 800 de la Gauchetière Ouest, Bureau 6900, Montréal, Québec, H5A 1K6, Canada

    Jean-Charles Grégoire

  3. Department of Physics and Computer Science, Wilfrid Laurier University, Waterloo, Ontario, N2L 3C5, Canada

    Angèle M. Hamel

Authors
  1. Jean-Charles Grégoire
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Angèle M. Hamel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ont., Canada

    Alejandro López-Ortiz

  2. Department of Physics and Computer Science, Wilfrid Laurier University, N2L 3C5, Waterloo, Ontario, Canada

    Angèle M. Hamel

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grégoire, JC., Hamel, A.M. (2005). You Can Get There from Here: Routing in the Internet. In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_17

Download citation

  • DOI: https://doi.org/10.1007/11527954_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27873-3

  • Online ISBN: 978-3-540-31860-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation