Advertisement

You Can Get There from Here: Routing in the Internet

  • Jean-Charles Grégoire
  • Angèle M. Hamel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3405)

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.

Keywords

Hash Function Hash Table IPv4 Address Complex Data Structure Forwarding Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 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. 3.
    Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.: Longest prefix matching using Bloom filters. In: Proceedings of SIGCOMM (2003)Google Scholar
  4. 4.
    Donnelly, A., Deegan, T.: IP router lookups as string matching. In: Proceedings of IEEE Local Computer Networks, LCN (2000)Google Scholar
  5. 5.
    Eatherton, W., Varghese, G., Dittia, Z.: Tree bitmap: Hardware/sofware IP lookups with incremental updates. Computer Comm. Review 34, 97–122 (2004)CrossRefGoogle Scholar
  6. 6.
    Ioannidis, I., Grama, A., Atallah, M.: Adaptive data structures for IP lookups. In: Proceedings of IEEE INFOCOM (2003)Google Scholar
  7. 7.
    Kim, B.-Y., Choi, Y.-H.: A pipelined routing lookup scheme with fast updates. Computer Comm. 26, 1594–1601 (2003)CrossRefGoogle Scholar
  8. 8.
    Knuth, D.E.: The Art of Computer Programming, vol. III. Addison Wesley, Reading (1973)Google Scholar
  9. 9.
    Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. In: Proceedings of IEEE INFOCOM (1998)Google Scholar
  10. 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)CrossRefGoogle Scholar
  11. 11.
    Lim, H., Seo, J.-H., Jung, Y.-J.: High speed IP address lookup architecture using hashing. IEEE Comm. Letters 7, 502–504 (2003)CrossRefGoogle Scholar
  12. 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)CrossRefGoogle Scholar
  13. 13.
    Nilsson, S., Karlsson, G.: Fast address lookup for Internet routers. In: Proceedings of IEEE Broadband Communications (1998)Google Scholar
  14. 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)CrossRefGoogle Scholar
  15. 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)CrossRefGoogle Scholar
  16. 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. 17.
    Sahni, S., Kim, K.S.: An O(log n) dynamic router–table design. IEEE Trans. on Computers 53, 351–363 (2004)CrossRefGoogle Scholar
  18. 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. 19.
    Varghese, G.: Network Algorithmics. Elsevier, Amsterdam (2005)zbMATHGoogle Scholar
  20. 20.
    Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable high–speed IP routing lookups. ACM Transactions on Computer Systems 19, 440–482 (2001)CrossRefGoogle Scholar
  21. 21.
    Warkhede, P., Suri, S., Varghese, G.: Multiway range trees: scalable IP lookup with fast updates. Computer Networks 44, 289–303 (2004)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jean-Charles Grégoire
    • 1
    • 2
  • Angèle M. Hamel
    • 3
  1. 1.Institut International des TélécommunicationsMontréalCanada
  2. 2.Institut National de la Recherche Scientifique–ÉnergieMatériaux,et TélécommunicationsMontréalCanada
  3. 3.Department of Physics and Computer ScienceWilfrid Laurier UniversityWaterlooCanada

Personalised recommendations