Skip to main content
SpringerLink
Log in

IP Lookup Technology for Internet Computing

  • Conference paper
  • First Online:
Wireless Internet (WiCON 2022)

Included in the following conference series:

Abstract

Internet protocol (IP) lookup is a key technology that affects network performance. Numerous studies have inves- tigated IP lookup and provided solutions for improving lookup algorithms. Herein, we utilized various state-of-the-art algorithms for improving IP lookup performance and explore trie-based algorithms to understand how these algorithms affect memory access or usage and the resulting reductions in IP lookup times. Moreover, we utizsed parallel data processing for increasing IP lookup throughput. These algorithms are applicable to all tries. Nevertheless, we conducted experiments by using only binary tries for simplicity. IP lookup algorithms were tested through simulations using real IPv4 router tables with 855,997 or 876,489 active prefixes. Finally, a synthetic architecture combining all of the discussed algorithms was proposed and evaluated.

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

References

  1. Hayes, B.: Cloud computing. Commun. ACM 51(7), 9–11 (2008). https://doi.org/10.1145/1364782.1364786

    Article  Google Scholar 

  2. Fuller, T.V., Yu, J.L., Varadhan, K.: Classless inter-domain routing (CIDR): an address assignment and aggregation strategy, RFC 1519, Sept (1993)

    Google Scholar 

  3. Postel, J.: Internet protocol DARPA internet program protocol specification, RFC791, Sept. (1981)

    Google Scholar 

  4. Zheng, K., Hu, C., Lu, H., Liu, B.: A TCAM-based distributed parallel IP lookup scheme and performance analysis. IEEE/ACM Trans. Netw. 14(4), 863–875 (2006)

    Article  Google Scholar 

  5. Cui, C., Deng, H., Telekom, D., Michel, U., Damker, H.: Network functions virtualisation

    Google Scholar 

  6. Zec, M., Rizzo, L., Mikuc, M.: DXR: towards a billion routing lookups per second in software. ACM SIGCOMM Comput. Commun. Rev. 42(5), 29–36 (2012)

    Article  Google Scholar 

  7. Jain, R.: A comparison of hashing schemes for address lookup in computer networks. IEEE Trans. Commun. 40(10), 1570–1573 (1992)

    Article  Google Scholar 

  8. Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.: Longest prefix matching using bloom filters. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 201–212 (2003)

    Google Scholar 

  9. Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, pp. 75–88 (2014)

    Google Scholar 

  10. Lim, H., Lee, N.: Survey and proposal on binary search algorithms for longest prefix match. IEEE Commun. Surv. Tutorials 14(3), 681–697 (2011)

    Google Scholar 

  11. Lim, H., Yim, C., Swartzlander, E.E.: Priority tries for IP address lookup. IEEE Trans. Comput. 59(6), 784–794 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Sahni, S., Kim, K.S.: Efficient construction of fixed-stride multibit tries for IP lookup. In: Proceedings Eighth IEEE Workshop on Future Trends of Distributed Computing Systems. FTDCS 2001, pp. 178–184 (2001)

    Google Scholar 

  13. Nilsson, S., Karlsson, G.: IP-address lookup using lC-tries. IEEE J. Selected Areas Commun. 17(6), 1083–1092 (1999)

    Article  Google Scholar 

  14. Sklower, K.: A tree-based packet routing table for Berkeley unix. USENIX Winter Citeseer 1991, 93–99 (1991)

    Google Scholar 

  15. Asai, H., Ohara, Y.: Poptrie: a compressed trie with population count for fast and scalable software IP routing table lookup. ACM SIGCOMM Comput. Commun. Rev. 45(4), 57–70 (2015)

    Article  Google Scholar 

  16. Islam, M.I., Khan, J.I.: CP-TRIE: Cumulative popcount based trie for ipv6 routing table lookup in software and ASIC. In: Proceedings of the 2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR), pp. 1–8. IEEE (2021)

    Google Scholar 

  17. Gupta, P., Lin, S., McKeown, N.: Routing lookups in hardware at memory access speeds. In: Proceedings of the IEEE INFOCOM 1998, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No. 98, vol. 3, pp. 1240–1247. IEEE (1998)

    Google Scholar 

  18. Srinivasan, V., Varghese, G.: Fast address lookups using controlled prefix expansion. ACM Trans. Comput. Syst. 17(1), 1–40 (1999). https://doi.org/10.1145/296502.296503

    Article  Google Scholar 

  19. BGP. https://bgp.potaroo.net/

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan

    Yen-Heng Lin & Sun-Yuan Hsieh

Authors
  1. Yen-Heng Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sun-Yuan Hsieh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sun-Yuan Hsieh .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Zygmunt J. Haas

  2. The University of Texas at Dallas, Richardson, TX, USA

    Ravi Prakash

  3. Texas A&M University-Kingsville, Kingsville, TX, USA

    Habib Ammari

  4. The University of Texas at Dallas, Richardson, TX, USA

    Weili Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2023 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lin, YH., Hsieh, SY. (2023). IP Lookup Technology for Internet Computing. In: Haas, Z.J., Prakash, R., Ammari, H., Wu, W. (eds) Wireless Internet. WiCON 2022. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 464. Springer, Cham. https://doi.org/10.1007/978-3-031-27041-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-27041-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-27040-6

  • Online ISBN: 978-3-031-27041-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation