Advertisement

Data Structures for IP Lookups, A Comparative Analysis with Scalability to IPV6

  • Soumyadeep GhoshEmail author
  • Oaindrila Das
  • Arindam Majumdar
Conference paper
  • 725 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 243)

Abstract

IP forwarding is a process where the routing table needs to be looked up to find which output port a packet should be forwarded through. To search the routing table efficiently we need to represent the routing table by a good data structure which is the major challenge for research in IP forwarding. Three major approaches have been proposed over the years namely Trie-based algorithms (which use linear search on prefix values), binary search on prefix values and binary search on prefix lengths. This paper compares the performance of these approaches and discusses their scalability to IPV6.

Keywords

IP lookup IP forwarding Trie Routing table Data structures 

References

  1. 1.
    RFC 2460, IETFGoogle Scholar
  2. 2.
    RFC 1631, IETFGoogle Scholar
  3. 3.
    RFC 1519, IETFGoogle Scholar
  4. 4.
    Fredkin, E.: Trie memory. Commun. ACM 3, 490–500 (1960)CrossRefGoogle Scholar
  5. 5.
    Nilsson, S., Karlsson, G.: IP address lookup using LC tries. IEEE J. Sel. Areas Commun. 17(6), 1083–1092 (1999)CrossRefGoogle Scholar
  6. 6.
    Kniesburges, S., Scheideler, C.: Hashed patricia trie: Efficient longest prefix matching in peer to peer systemsGoogle Scholar
  7. 7.
    Ruiz-Sanchez, M.A., Biersack, E.M., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Netw. 15(2), 8–23 (2001)CrossRefGoogle Scholar
  8. 8.
    Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable high speed IP routing lookups. In: Proceedings of ACM SM, pp. 25–35 (1997)Google Scholar
  9. 9.
    Lim, H., Lee, N.: Survey and proposal on binary search algorithms for longest prefix match. IEEE Commun. Surv. Tutorials 14(3) (2012) (Third quater)Google Scholar
  10. 10.
    Sahni, S., Kim, K.: Efficient construction of multibit tries for IP lookup. IEEE/ACM Trans. Netw. 11(4), 650–662 (2003)CrossRefGoogle Scholar
  11. 11.
    Sangireddy, R., Futamura, N., Aluru, S., Somani, A.K.: Scalable, memory efficient, high-speed algorithms for IP lookups. IEEE/ACM Trans. Netw. 13(4), 802–812 (2005)CrossRefGoogle Scholar
  12. 12.
    Futamura, N., Sangireddy, R., Aluru, S., Somani, A.K.: Scalable, memory efficient high-speed lookup and update algorithms for IP routing. In: Proceedings of IEEE Computer Communications and Networks (ICCCN), pp. 257–263 (2003)Google Scholar
  13. 13.
    Dharmapurikar, S., Krishnamurthy, P., Taylor, D.: Longest prefix matching using bloom filters. IEEE/ACM Trans. Netw. 14(2), 397–409 (2006)CrossRefGoogle Scholar
  14. 14.
    Lim, H., Seo, J., Jung, Y.: High speed IP address lookup architecture using hashing. IEEE Commun. Lett. 7(10), 502–504 (2003)CrossRefGoogle Scholar
  15. 15.
    Lim, K., Park, K., Lim, H.: Binary search on levels using a bloom filter for IPv6 address lookup. IEEE/ACM ANCS, pp. 185–186 (2009)Google Scholar
  16. 16.
    Kurose, J.F., Ross, K.W.: Computer Networking: A Top-Down Approach. Pearson Education (2010)Google Scholar

Copyright information

© Springer India 2014

Authors and Affiliations

  • Soumyadeep Ghosh
    • 1
    Email author
  • Oaindrila Das
    • 1
  • Arindam Majumdar
    • 2
  1. 1.Department of Computer Science and EngineeringInternational Institute of Information TechnologyBhubaneswarIndia
  2. 2.Department of Computer ScienceAPC CollegeKolkataIndia

Personalised recommendations