Cluster Computing

, Volume 22, Supplement 3, pp 6681–6692 | Cite as

Bloom-filter-based request node collaboration caching for named data networking

  • Rui HouEmail author
  • Lang Zhang
  • Tingting Wu
  • Tengyue Mao
  • Jiangtao Luo


To promote data caching efficiency, caching space utilization, and data content searching speed of the content store (CS) unit in named data networking (NDN) routers, a sum-up Bloom-filter-based request node collaboration caching (BRCC) approach is proposed in this paper. BRCC realizes different forms of caching for different types of data content. It sets the data content life time in accordance with its request frequency. It thereby promotes caching efficiency by caching high-frequent requested data content around the request node. In addition, it enhances the data content matching rate and decreases the searching time by using the sum-up Bloom filter. Simulation results showed that BRCC can efficiently utilize the CS caching space of NDN routers, reduce duplicate data caching, promote the cache hit rate, and increase the data content searching speed.


Named data networking Bloom filter Collaboration caching Caching life time 



This work was supported by the National Natural Science Foundation of China under Grant 60841001; the Natural Science Foundation of State Ethnic Affairs Commission of People’s Republic of China under Grant 12ZNZ010; the Scientific and Technological Projects of Wuhan, China, under Grant 2015010101010008; the Foundation of China Scholarship Council; and the Special Fund for Basic Scientific Research of Central Colleges, South-Central University for Nationalities, under Grant No. CZP17042. The authors thank all the reviewers for their useful comments.


  1. 1.
    Awais, M., Shah, M.A.: Information-centric networking: a review on futuristic networks. In: 2017 23rd International Conference on Automation and Computing (ICAC), Huddersfield, pp. 1–5 (2017)Google Scholar
  2. 2.
    Ioannou, A., Weber, S.: A survey of caching policies and forwarding mechanisms in information-centric networking. IEEE Commun. Surv. Tutor. 18(4), 2847–2886 (2016)CrossRefGoogle Scholar
  3. 3.
    Soniya, M.M.S., Kumar, K.: A survey on named data networking. In: 2015 2nd International Conference on Electronics and Communication Systems (ICECS), Coimbatore, pp. 1515–1519 (2015)Google Scholar
  4. 4.
    Li, J., Shi, S., Ren, Y., Li, L., Zhi, J.: Content store-based module for congestion control algorithms of named data networking. In: 2016 IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS), Sydney, NSW, pp. 253–259 (2016)Google Scholar
  5. 5.
    Ding, W., Yan, Z., Deng, R.H.: Survey on future internet security architectures. IEEE Access 4, 4374–4393 (2016)CrossRefGoogle Scholar
  6. 6.
    Xylomenos, G., Ververidis, C.N., Siris, V.A., Fotiou, N., Tsilopoulos, C., Vasilakos, X., Polyzos, G.C.: A survey of information-centric networking research. IEEE Commun. Surv. Tutor. 16(2), 1024–1049 (2014)CrossRefGoogle Scholar
  7. 7.
    Shailendra, S., Sengottuvelan, S., Rath, H.K., Panigrahi, B., Simha, A.: Performance evaluation of caching policies in NDN: an ICN architecture. In: 2016 IEEE Region 10 Conference (TENCON), Singapore, pp. 1117–1121 (2016)Google Scholar
  8. 8.
    Zhang, G., Wang, X., Gao, Q., Liu, Z.: Hybrid ICN cache coordination scheme based on role division between cache nodes. In: 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, CA, pp. 1–6 (2015)Google Scholar
  9. 9.
    Laoutaris, N., Hao, C., Stavrakakis, I.: The LCD interconnection of LRU caches and its analysis. J. Perform. Eval. 63, 609–643 (2006)CrossRefGoogle Scholar
  10. 10.
    Psaras, I., Chai, W.K., Pavlou, G.: Probabilistic in-network caching for information-centric networks. In: Proceedings of the 2nd Edition of the ICN Workshop on Information-Centric Networking, ACM, pp. 55–60 (2012)Google Scholar
  11. 11.
    Eum, S., Nakauchi, K., Murata, M., et al.: CATT: potential based routing with content caching for ICN. In: Proceedings of the 2nd Edition of the ICN Workshop on Information-centric Networking, ACM, pp. 49–54 (2012)Google Scholar
  12. 12.
    Chai, W.K., He, D., Psaras, I., et al.: Cache “less for more” in information-centric networks. In: Proceedings of the 11th International IFIP TC 6 Conference on Networking, vol. 7289, pp. 27–40 (2012)CrossRefGoogle Scholar
  13. 13.
    Ming, Z., Xu, M., Wang, D.: Age-based cooperative caching in information-centric networks. In: 2012 Proceedings IEEE INFOCOM Workshops, Orlando, FL, pp. 268–273 (2012)Google Scholar
  14. 14.
    Cho, K., Lee, M., Park, K., Kwon, T.T., Choi, Y., Pack, S.: WAVE: popularity-based and collaborative in-network caching for content-oriented networks. In: 2012 Proceedings IEEE INFOCOM Workshops, Orlando, FL, pp. 316–321 (2012)Google Scholar
  15. 15.
    Zhang, R., Liu, J., Huang, T., Pan, T., Wu, L.: Adaptive compression trie based Bloom filter: request filter for NDN content store. IEEE Access 5, 23647–23656 (2017)CrossRefGoogle Scholar
  16. 16.
    Mun, J.H., Lim, H.: Cache sharing using a Bloom filter in named data networking. In: 2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Santa Clara, CA, pp. 127–128 (2016)Google Scholar
  17. 17.
    Feng, Y.H., Huang, N.F., Chen, C.H.: Efficient caching mechanism for network-based URL filtering by multi-level counting Bloom filters. In: 2011 IEEE International Conference on Communications (ICC), Kyoto, pp. 1–6 (2011)Google Scholar
  18. 18.
    Park, C., Hwang, S.: Fast URL lookup using URL prefix hash tree. J. KIISE 35(1), 67–75 (2008)Google Scholar
  19. 19.
    Wang, Y., Dai, H., Jiang, J., He, K., Meng, W., Liu, B.: Parallel name lookup for named data networking. In: 2011 IEEE Global Telecommunications Conference—GLOBECOM 2011, Houston, TX, USA, pp. 1–5 (2011)Google Scholar
  20. 20.
    Wang, Y., et al.: Scalable name lookup in NDN using effective name component encoding. In: 2012 IEEE 32nd International Conference on Distributed Computing Systems, Macau, pp. 688–697 (2012)Google Scholar
  21. 21.
    Huang, K., et al.: Multi-partitioning approach to building fast and accurate counting Bloom filters. In: 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, Boston, MA, pp. 1159–1170 (2013)Google Scholar
  22. 22.
    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)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Mun, J.H., Lim, H.: On reducing false positives of a bloom filter in trie-based algorithms. In: 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Marina del Rey, CA, pp. 249–250 (2014)Google Scholar
  24. 24.
    Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J. Sel. Areas Commun. 15(3), 332–345 (1997)CrossRefGoogle Scholar
  25. 25.
    Bacher, F., Rainer, B., Hellwagner, H.: Towards controller-aided multimedia dissemination in named data networking. In: 2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW), Turin, pp. 1–6 (2015)Google Scholar
  26. 26.
    Aoki, M., Shigeyasu, T.: Effective content management technique based on cooperation cache among neighboring routers in content-centric networking. In: 2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA), Taipei, pp. 335–340 (2017)Google Scholar
  27. 27.
    Zhang, Z., Ma, H., Liu, L.: Cache-aware named data forwarding in Internet of Things. In: 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, CA, pp. 1–6 (2015)Google Scholar
  28. 28.
    Kim, D., Ko, Y.B.: On-demand anchor-based mobility support method for named data networking. In: 2017 19th International Conference on Advanced Communication Technology (ICACT), Bongpyeong, pp. 19–23 (2017)Google Scholar
  29. 29.
    Kanda, S., Fuketa, M., Morita, K., Aoe, J.I.: Trie compact representation using double-array structures with string labels. In: 2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA), Hiroshima, pp. 3–8 (2015)Google Scholar
  30. 30.
    URL Blacklist. Accessed 25 Oct 2017

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Rui Hou
    • 1
    Email author
  • Lang Zhang
    • 1
  • Tingting Wu
    • 1
  • Tengyue Mao
    • 1
  • Jiangtao Luo
    • 2
  1. 1.College of Computer ScienceSouth-Central University for NationalitiesWuhanChina
  2. 2.Electronic Information and Networking Research InstituteChongqing University of Posts and TelecommunicationsChongqingChina

Personalised recommendations