Cache sharing using bloom filters in named data networking

In recently emerged Named Data Networking (NDN) technology, each router has a cache to store and provide frequently requested contents. Hence, an efficient cache management scheme is essential for effective content distribution and high cache utilization. As a new cache management scheme, this paper proposes the sharing of cache summaries with neighboring routers to increase the diversity of cached contents in NDN. Our proposed scheme defines a summary packet using a Bloom filter and a method to share the summary. When a Data packet is received, a router makes the decision of whether or not to save the Data depending on query results of the cache summaries of neighboring routers. If any of the neighboring routers have the Data, the Data has not necessarily been saved. When an Interest packet is received, a router can forward the Interest to a neighboring router that has the requested content by checking the summaries. The proposed scheme is evaluated using ndnSIM, which is an NS-3 based Named Data Networking simulator. Simulation results show that the sharing of cache summaries enhances the content diversity and accordingly the cache hit ratio, and reduces the average content delivery time.

[1]  Alexander Afanasyev,et al.  journal homepage: www.elsevier.com/locate/comcom , 2022 .

[2]  Mingchu Li,et al.  Energy-efficient quality of service aware forwarding scheme for Content-Centric Networking , 2015, J. Netw. Comput. Appl..

[3]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[4]  Yanghee Choi,et al.  CoRC: Coordinated routing and caching for named data networking , 2014, 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[5]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[6]  Tian He,et al.  kBF: A Bloom Filter for key-value storage with an application on approximate state machines , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[7]  Sasu Tarkoma,et al.  Theory and Practice of Bloom Filters for Distributed Systems , 2012, IEEE Communications Surveys & Tutorials.

[8]  Jian Gong,et al.  Enhancing in-network caching by coupling cache placement, replacement and location , 2015, 2015 IEEE International Conference on Communications (ICC).

[9]  Jaime García-Reinoso,et al.  Scalable data replication in content-centric networking based on alias names , 2015, J. Netw. Comput. Appl..

[10]  Shunzheng Yu,et al.  Network coding-based multisource content delivery in Content Centric Networking , 2016, J. Netw. Comput. Appl..

[11]  Yanghee Choi,et al.  WAVE: Popularity-based and collaborative in-network caching for content-oriented networks , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[12]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[13]  George Pavlou,et al.  Cache "less for more" in information-centric networks (extended version) , 2013, Comput. Commun..

[14]  George Pavlou,et al.  Cache "Less for More" in Information-Centric Networks , 2012, Networking.

[15]  Hao Wu,et al.  EMC: The Effective Multi-Path Caching Scheme for Named Data Networking , 2013, 2013 22nd International Conference on Computer Communication and Networks (ICCCN).

[16]  Ibrahim Abdullahi,et al.  Survey on caching approaches in Information Centric Networking , 2015, J. Netw. Comput. Appl..

[17]  Jungwon Lee,et al.  Name prefix matching using bloom filter pre-searching , 2015, 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[18]  Hongke Zhang,et al.  A Survey of Caching Mechanisms in , 2015 .

[19]  Meng Zhang,et al.  A Survey of Caching Mechanisms in Information-Centric Networking , 2015, IEEE Communications Surveys & Tutorials.

[20]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[21]  George Varghese,et al.  Beyond bloom filters: from approximate membership checks to approximate state machines , 2006, SIGCOMM 2006.

[22]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Guoqiang Zhang,et al.  Caching in information centric networking: A survey , 2013, Comput. Networks.

[24]  Olivier Festor,et al.  A Comparison of Caching Strategies for Content Centric Networking , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[25]  Gaogang Xie,et al.  A Shifting Bloom Filter Framework for Set Queries , 2015, Proc. VLDB Endow..

[26]  László Böszörményi,et al.  A survey of Web cache replacement strategies , 2003, CSUR.

[27]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2002, TNET.