Skip to main content
SpringerLink
Log in

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

  • Conference paper
Intelligent Computing, Networking, and Informatics

Part of the book series: Advances in Intelligent Systems and Computing ((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.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. RFC 2460, IETF

    Google Scholar 

  2. RFC 1631, IETF

    Google Scholar 

  3. RFC 1519, IETF

    Google Scholar 

  4. Fredkin, E.: Trie memory. Commun. ACM 3, 490–500 (1960)

    Article  Google Scholar 

  5. Nilsson, S., Karlsson, G.: IP address lookup using LC tries. IEEE J. Sel. Areas Commun. 17(6), 1083–1092 (1999)

    Article  Google Scholar 

  6. Kniesburges, S., Scheideler, C.: Hashed patricia trie: Efficient longest prefix matching in peer to peer systems

    Google Scholar 

  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)

    Article  Google Scholar 

  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. 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. Sahni, S., Kim, K.: Efficient construction of multibit tries for IP lookup. IEEE/ACM Trans. Netw. 11(4), 650–662 (2003)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. Dharmapurikar, S., Krishnamurthy, P., Taylor, D.: Longest prefix matching using bloom filters. IEEE/ACM Trans. Netw. 14(2), 397–409 (2006)

    Article  Google Scholar 

  14. Lim, H., Seo, J., Jung, Y.: High speed IP address lookup architecture using hashing. IEEE Commun. Lett. 7(10), 502–504 (2003)

    Article  Google Scholar 

  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. Kurose, J.F., Ross, K.W.: Computer Networking: A Top-Down Approach. Pearson Education (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, International Institute of Information Technology, Bhubaneswar, India

    Soumyadeep Ghosh & Oaindrila Das

  2. Department of Computer Science, APC College, Kolkata, India

    Arindam Majumdar

Authors
  1. Soumyadeep Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oaindrila Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arindam Majumdar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soumyadeep Ghosh .

Editor information

Editors and Affiliations

  1. Computer Science and Engineering, National Institute of Technology Rourkela, Rourkela, Orissa, India

    Durga Prasad Mohapatra

  2. Computer Science and Engineering, SOA University, Bhubaneswar, India

    Srikanta Patnaik

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Ghosh, S., Das, O., Majumdar, A. (2014). Data Structures for IP Lookups, A Comparative Analysis with Scalability to IPV6. In: Mohapatra, D.P., Patnaik, S. (eds) Intelligent Computing, Networking, and Informatics. Advances in Intelligent Systems and Computing, vol 243. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1665-0_124

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1665-0_124

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1664-3

  • Online ISBN: 978-81-322-1665-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation