Skip to main content
SpringerLink
Log in

A Filter-Based Design of Pending Interest Table in Named Data Networking

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

Abstract

Named data networking (NDN) is a recently proposed networking model that intends to overcome the restrictions of the current Internet Protocol (IP). Many research works have been attracted to this modern Internet architecture but the pending interest table (PIT), which is one of the most important constituent of NDN node, did not take considerable concern. The PIT plays an essential role in the communication process for NDN nodes and in both directions (i.e. receiving interest packets during upstream way and receiving data packets during downstream way). PIT should be sufficiently large to accommodate a large amount of information. Also, It must be fast adequate to not be a bottleneck in the forwarding process. In this paper, we propose a novel PIT implementation called FTDF-PIT for NDN. This new design depends on employing an approximate data structure that called fast two dimensional filter (FTDF) which has better performance than the other proposed filters (Bloom and Quotient filters). This filter has high performance in terms of: insertion/deletion/query throughput, low memory requirements, and low false positive rate which makes it very suitable for implementing PIT. Our evaluations show that utilizing FTDF-PIT can result in many advantages over the existing solutions in terms of: reducing the memory consumption, minimizing false positive rate, and increasing the building and updating processes which make it very suitable to meet the current network demands.

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
Fig. 16

Similar content being viewed by others

References

  1. Vasilakos, A.V., Li, Z., Simon, G., Yo, W.: Information centric network: research challenges and opportunities. J. Netw. Comput. Appl. 52, 1–10 (2015)

    Article  Google Scholar 

  2. Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: ACM CoNEXT 2009, pp. 1–12, December (2009)

  3. Zhang, L., Estrin, D., Burke, J., Jacobson, V., Thornton, J.D., Smetters, D.K., Zhang, B., Tsudik, G., Claffy, K., Krioukov, D., Massey, D., Papadopoulos, C., Abdelzaher, T., Wang, L., Crowley, P., Yeh, E.: Named data networking (ndn) project. Technical Report NDN-0001, Palo Alto Research Center (PARC) (2010)

  4. Li, F., Chen, F., Wu, J., Xie, H.: Longest prefix lookup in named data networking: how fast can it be?. In: 9th IEEE International Conference on Networking, Architecture, and Storage, pp. 186–190, August (2014)

  5. Quan, W., Xu, C., Guan, J., Zhang, H., Grieco, L.A.: Scalable name lookup with adaptive prefix Bloom filter for named data networking. IEEE Commun. Lett. 18, 102–105 (2014)

    Article  Google Scholar 

  6. Huang, S., Xu, J., Yang, X., Wu, Z., Niu, C.: Steerable name lookup based on classified prefixes and scalable one memory access Bloom filter for named data networking. Int. J. Future Gener. Commun. Netw. 9(7), 87–100 (2016)

    Article  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, October (2013)

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

    Article  Google Scholar 

  9. Zhang, L., Afanasyev, A., Burke, J., Jacobson, V., Claffy, K., Crowley, P., Papadopoulos, C., Wang, L., Zhang, B.: Named data networking. SIGCOMM Comput. Commun. Rev. 44(3), 66–73 (2014)

    Article  Google Scholar 

  10. Wang, Y., Dai, H., Zhang, T., Meng, W., Fan, J., Liu, B.: Gpu-accelerated name lookup with component encoding. Comput. Netw. 57(16), 3165–3177 (2013)

    Article  Google Scholar 

  11. Cheng, Y., Alexander, A., Lan, W., Beichuan, Z., Lixia, Z.: Adaptive forwarding in named data networking. SIGCOMM Comput. Commun. Rev. 42(3), 62–67 (2012)

    Article  Google Scholar 

  12. You, W., Mathieu, B., Truong, P., Peltier, J., Simon, G.: Dipit: a distributed Bloom-filter based pit table for ccn nodes. In: 21st International Conference on Computer Communications and Networks (ICCCN), pp. 1–7, July (2012)

  13. Shubbar, R., Ahmadi, M.: Efficient name matching based on a fast two-dimensional filter in named data networking. Int. J. Parallel Emerg. Distrib. Syst. 34(2), 203–221 (2019)

    Article  Google Scholar 

  14. Bender, M., Farach-Colton, M., Johnson, R., Kuszmaul, B.C., Medjedovic, D., Montes, A.R.P.S.P., Shetty, P., Zadok, E.: Dont thrash: how to cache your hash on flash. In: Proceedings of the VLDB Endowment, vol. 5, pp. 1627–1637 (2012)

  15. Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Addison Wesley, Reading (1973)

    MATH  Google Scholar 

  16. Ravikumar, V.C., Mahapatra, R.N.: Tcam architecture for ip lookup using prefix properties. IEEE Micro 24, 60–69 (2004)

    Article  Google Scholar 

  17. Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable high speed ip routing lookups. SIGCOMM Comput. Commun. Rev. 27(4), 25–36 (1997)

    Article  Google Scholar 

  18. Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.: Longest prefix matching using Bloom filters. IEEE/ACM Trans. Netw. 14, 397–409 (2006)

    Article  Google Scholar 

  19. Perino, D., Varvello, M.: A reality check for content centric networking. In: Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking, pp. 44–49, August (2011)

  20. 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, April (2014)

  21. 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, October (2012)

  22. Li, Z., Bi, J., Jun, W., Wang, S., Jiang, X.: Compression of pending interest table with Bloom filter in content centric network. In: Proceedings of the 7th International Conference on Future Internet Technologies, pp. 46–46, September (2012)

  23. Yuan, H.: Data structures and algorithms for scalable NDN forwarding. Ph.D. thesis, Washington University in St. Louis (2015)

  24. Popa, L., Ghodsi, A., Stoica, I.: Http as the narrow waist of the future internet. In: Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks, pp. 1–6, October (2010)

  25. Saxena, D., Raychoudhury, V., Suri, N., Becker, C., Cao, J.: Named data networking: a survey. Comput. Sci. Rev. 19, 15–55 (2016)

    Article  MathSciNet  Google Scholar 

  26. Xylomenos, G., Ververidis, C.N., Siris, V.A., Fotiou, N., Tsilopoulos, C., Vasilakos, X., Katsaros, K.V., Polyzos, G.C.: A survey of information-centric networking research. IEEE Commun. Surv. Tutor. 16(2), 1024–1049 (2014)

    Article  Google Scholar 

  27. Bouk, S.H., Ahmed, S.H., Kim, D.: Hierarchical and hash based naming with compact trie name management scheme for vehicular content centric networks. Comput. Commun. 71, 73–83 (2015)

    Article  Google Scholar 

  28. Tan, Y., Zhu, S.: Efficient name lookup scheme based on hash and character trie in named data networking. In: 12th Web Information System and Application Conference (WISA), pp. 130–135, September (2015)

  29. Luo, J., Wu, C., Jiang, Y., Tong, J.: Name label switching paradigm for named data networking. IEEE Commun. Lett. 19, 335–338 (2015)

    Article  Google Scholar 

  30. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 422–426 (1970)

    Article  MATH  Google Scholar 

  31. Liu, X., Qi, H., Li, K., Stojmenovic, I., Liu, A.X., Shen, Y., Qu, W., Xue, W.: Sampling Bloom filter-based detection of unknown RFID tags. IEEE Trans. Commun. 63, 1432–1442 (2015)

    Article  Google Scholar 

  32. Bonelli, N., Callegari, C., Giordano, S., Procissi, G.: A Bloom filter bank based hash table for high speed packet processing. In: 2014 IEEE International Conference on High Performance Computing and Communications, pp. 974–981, August (2014)

  33. Reviriego, P., Pontarelli, S., Maestro, J.A., Ottavi, M.: A synergetic use of Bloom filters for error detection and correction. IEEE Trans. Very Large Scale Integr. VLSI Syst. 23, 584–587 (2015)

    Article  MATH  Google Scholar 

  34. Yao, Y., Xiong, S., Qi, H., Liu, Y., Tolbert, L.M., Cao, Q.: Efficient histogram estimation for smart grid data processing with the loglog-Bloom-filter. IEEE Trans. Smart Grid 6, 199–208 (2015)

    Article  Google Scholar 

  35. Zink, T., Waldvogel, M.: Efficient hash tables for network applications. SpringerPlus 4, 222–242 (2015)

    Article  Google Scholar 

  36. Al-hisnawi, M., Ahmadi, M.: Deep packet inspection using quotient filter. IEEE Commun. Lett. 20(11), 2217–2220 (2016)

    Article  Google Scholar 

  37. Schnurrenberger, U.: The content name collection, cnc. http://www.icn-names.net/. June 2017

  38. Wang, Y., He, K., Dai, H., Meng, W., Jiang, J., Liu, B., Chen, Y.: Scalable name lookup in ndn using effective name component encoding. In: 32nd IEEE International Conference on Distributed Computing Systems, pp. 688–697, June (2012)

Download references

Author information

Authors and Affiliations

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

    Roaa Shubbar & Mahmood Ahmadi

Authors
  1. Roaa Shubbar
    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

Shubbar, R., Ahmadi, M. A Filter-Based Design of Pending Interest Table in Named Data Networking. J Netw Syst Manage 27, 998–1019 (2019). https://doi.org/10.1007/s10922-019-09495-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-019-09495-y

Keywords

Search

Navigation