Skip to main content
SpringerLink
Log in

2DNCF-PIT: Two-Dimensional Neighbor-Based Cuckoo Filter for Pending Interest Table Lookup in Named Data Networking

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

Named data networking is one of the proposed architectures for the future Internet. In this architecture, names play an essential role. Packets in named data networking have names that are used instead of IP addresses, and based on these names, packets are forwarded through the network routers. For this purpose, named data network routers have three data structures content store, pending interest table (PIT), and forwarding information base. In named data networking, the PIT table plays an important role. In this table, the information of all Interest packets waiting for Data packets is stored. The PIT should be able to search, delete, update information quickly, and in turn, take up little memory space. In this paper, a new variant of the Cuckoo filter to improve the performance of the PIT table called two-dimensional neighbor-based Cuckoo filter (2DNCF) is proposed. The proposed 2DNCF uses the physical neighbor of the selected bucket by the Cuckoo filter that increases the utilization of the neighbor buckets, as well as the performance of the proposed 2DNCF filter. In this data structure, which is essentially a two-dimensional Cuckoo filter, an attempt has been made to use the second hashing function less than the first one in the Cuckoo filter. Due to less use of the second hashing function in this filter, it is more efficient in inserting, deleting, and searching than the standard Cuckoo filter. The simulation results show that this filter has a lower false positive rate than the standard Cuckoo filter. Accordingly, it improves the insertion, deletion and lookup performance of the PIT table compared to the other solutions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: CoNEXT ’09: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp. 1–12 (2009) 

  2. Shubbar, R., Ahmadi, M.: A filter-based design of pending interest table in named data networking. J. Netw. Syst. Manag. 27(4), 998–1019 (2019)

    Article  Google Scholar 

  3. Azgin, A., Ravindran, R., Wang, G.: PIT/less: stateless forwarding in content centric networks. In: 2016 IEEE Global Communications Conference (GLOBECOM), pp. 1–7. IEEE, Washington, DC (2016)

    Google Scholar 

  4. Mansour, D., Osman, H., Tschudin, C.: Load balancing in the presence of services in named-data networking. J. Netw. Syst. Manag. 28, 298–339 (2020). https://doi.org/10.1007/s10922-019-09507-x

    Article  Google Scholar 

  5. Saxena, D., Raychoudhury, V.: Radient: scalable, memory efficient name lookup algorithm for named data networking. J. Netw. Comput. Appl. 63, 1–13 (2016). https://doi.org/10.1016/j.jnca.2015.12.009

    Article  Google Scholar 

  6. Dai, H., Liu, B., Chen, Y., Wang, Y.: On pending interest table in named data networking. In: 2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), pp. 211–222. IEEE, Austin (2012)

    Google Scholar 

  7. So, W., Narayanan, A., Oran, D.: Named data networking on a router: fast and dos-resistant forwarding with hash tables. In: Architectures for Networking and Communications Systems, pp. 215–225. IEEE, San Jose (2013)

    Chapter  Google Scholar 

  8. Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. CoNEXT 14, 75–88 (2014)

    Google Scholar 

  9. Mun, J.H., Lim, H.: New approach for efficient IP address lookup using a bloom filter in trie-based algorithms. IEEE Trans. Comput. 65(5), 1558–1565 (2016)

    Article  MathSciNet  Google Scholar 

  10. Kwon, M., Reviriego, P., Pontarelli, S.: A length-aware cuckoo filter for faster IP lookup. In: 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1071–1072. IEEE, San Francisco (2016)

    Chapter  Google Scholar 

  11. Li, Z., Liu, K., Zhao, Y., Ma, Y.: Mapit: an enhanced pending interest table for ndn with mapping bloom filter. IEEE Commun. Lett. 18(11), 1915–1918 (2014)

    Article  Google Scholar 

  12. So, W., Narayanan, A., Oran, D., Wang, Y.: Toward fast NDN software forwarding lookup engine based on hash tables. In: 2012 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), pp. 85–86 (2012)

  13. Alubady, R., Hassan, S., Habbal, A.: Pending interest table control management in named data network. J. Netw. Comput. Appl. 111, 99–116 (2018)

    Article  Google Scholar 

  14. Tan, Y., Li, Q., Jiang, Y., Xia, S.: Rapit: Rtt-aware pending interest table for content centric networking. In: 2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC), pp. 1–8. IEEE, Nanjing (2015)

    Google Scholar 

  15. You, W., Mathieu, B., Truong, P., Peltier, J.F., Simon, G.: Dipit: a distributed bloom-filter based PIT table for CCN nodes. In: 2012 21st International Conference on Computer Communications and Networks (ICCCN), pp. 1–7. IEEE, Munich (2012)

    Google Scholar 

  16. Sivaraman, V., Guha, D., Sikdar, B.: Optimal pending interest table size for icn with mobile producers. IEEE/ACM Trans. Netw. 28(4), 1615–1628 (2020)

    Article  Google Scholar 

  17. Buragohain, M., Nandi, S.: Quality of service provisioning in named data networking via PIT entry reservation and PIT replacement policy. Comput Commun. 155, 166–183 (2020)

    Article  Google Scholar 

  18. Yuan, H., Crowley, P.: Scalable pending interest table design: from principles to practice. In: IEEE INFOCOM 2014—IEEE Conference on Computer Communications, pp. 2049–2057. IEEE, Toronto (2014)

    Chapter  Google Scholar 

  19. Li, Z., Xu, Y., Zhang, B., Yan, L., Liu, K.: Packet forwarding in named data networking requirements and survey of solutions. IEEE Commun. Surv. Tutor. 21(2), 1950–1987 (2019). https://doi.org/10.1109/COMST.2018.2880444

    Article  Google Scholar 

  20. Almeida, P.S., Baquero, C., Preguia, N., Hutchison, D.: Scalable bloom filters. Inf. Process. Lett. 101(6), 255–261 (2007)

    Article  MathSciNet  Google Scholar 

  21. Knuth, D.E.: The art of computer programming. In: Fundamental Algorithms, 3rd edn. Addison Wesley, Boston (1997)

    MATH  Google Scholar 

  22. Varvello, M., Perino, D., Linguaglossa, L.: On the design and implementation of a wire-speed pending interest table. In: 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 369–374. IEEE, Turin (2013). https://doi.org/10.1109/INFCOMW.2013.6970719

    Chapter  Google Scholar 

  23. Yu, W., Pao, D.: Hardware accelerator to speed up packet processing in ndn router. Comput. Commun. 91(C), 109–119 (2016). https://doi.org/10.1016/j.comcom.2016.06.004

    Article  Google Scholar 

  24. Fang, P., Wolf, T.: Enabling virtual network functions in named data networking. In: IEEE INFOCOM 2021—IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1–6. IEEE, Vancouver (2021)

    Google Scholar 

  25. Taniguchi, K., Takemasa, J., Koizumi, Y., Hasegawa, T.: A method for designing high-speed software NDN routers. ACM-ICN ’16, pp. 203–204. 10.1145/2984356.2985234 (2016)

  26. Shi, J., Pesavento, D., Benmohamed, L.: NDN–DPDK: NDN forwarding at 100 gbps on commodity hardware. In: Proceedings of the 7th ACM Conference on Information-Centric Networking, ICN ’20, pp. 30–40 (2020)

  27. Dharmapurikar, S., Krishnamurthy, P., Sproull, T., Lockwood, J.: Deep packet inspection using parallel bloom filters. IEEE Micro 24(1), 52–61 (2004). https://doi.org/10.1109/MM.2004.1268997

    Article  Google Scholar 

  28. Reviriego, P., Martnez, J., Pontarelli, S.: CFBF: reducing the insertion time of cuckoo filters with an integrated bloom filter. IEEE Commun. Lett. 23(10), 1857–1861 (2019). https://doi.org/10.1109/LCOMM.2019.2930508

    Article  Google Scholar 

  29. Safi, E., Moshovos, A., Veneris, A.: L-CBF: a low-power, fast counting bloom filter architecture. In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp. 628–638. IEEE, Hoboken (2008). https://doi.org/10.1109/TVLSI.2008.2000244

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran

    Arman Mahmoudi & Mahmood Ahmadi

Authors
  1. Arman Mahmoudi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahmood Ahmadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mahmood Ahmadi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mahmoudi, A., Ahmadi, M. 2DNCF-PIT: Two-Dimensional Neighbor-Based Cuckoo Filter for Pending Interest Table Lookup in Named Data Networking. J Netw Syst Manage 30, 48 (2022). https://doi.org/10.1007/s10922-022-09661-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10922-022-09661-9

Keywords

Search

Navigation