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

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.

[1]  Jiang Liu,et al.  Adaptive Compression Trie Based Bloom Filter: Request Filter for NDN Content Store , 2017, IEEE Access.

[2]  Sun-Young Hwang,et al.  Fast URL Lookup Using URL Prefix Hash Tree , 2008 .

[3]  Nen-Fu Huang,et al.  An Efficient Caching Mechanism for Network-Based URL Filtering by Multi-Level Counting Bloom Filters , 2011, 2011 IEEE International Conference on Communications (ICC).

[4]  Hermann Hellwagner,et al.  Towards controller-aided multimedia dissemination in Named Data Networking , 2015, 2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW).

[5]  Bin Liu,et al.  Scalable Name Lookup in NDN Using Effective Name Component Encoding , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[6]  Hyesook Lim,et al.  On Reducing False Positives of a Bloom Filter in Trie-Based Algorithms , 2015 .

[7]  Bin Liu,et al.  Parallel Name Lookup for Named Data Networking , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[8]  Robert H. Deng,et al.  A Survey on Future Internet Security Architectures , 2016, IEEE Access.

[9]  Tetsuya Shigeyasu,et al.  Effective Content Management Technique Based on Cooperation Cache among Neighboring Routers in Content-Centric Networking , 2017, 2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA).

[10]  Wei Li,et al.  A Multi-partitioning Approach to Building Fast and Accurate Counting Bloom Filters , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

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

[12]  Muhammad Awais,et al.  Information-centric networking: A review on futuristic networks , 2017, 2017 23rd International Conference on Automation and Computing (ICAC).

[13]  Hyesook Lim,et al.  New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms , 2016, IEEE Transactions on Computers.

[14]  Zhen Liu,et al.  A Hybrid ICN Cache Coordination Scheme Based on Role Division between Cache Nodes , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

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

[16]  Murata Masayuki,et al.  CATT: Potential Based Routing with Content Caching for ICN , 2012 .

[17]  Nikolaos Laoutaris,et al.  The LCD interconnection of LRU caches and its analysis , 2006, Perform. Evaluation.

[18]  Stefan Weber,et al.  A Survey of Caching Policies and Forwarding Mechanisms in Information-Centric Networking , 2016, IEEE Communications Surveys & Tutorials.

[19]  Nikos Fotiou,et al.  A Survey of Information-Centric Networking Research , 2014, IEEE Communications Surveys & Tutorials.

[20]  Douglas S. Reeves,et al.  Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .

[21]  George Pavlou,et al.  Probabilistic in-network caching for information-centric networks , 2012, ICN '12.

[22]  Hyesook Lim,et al.  Cache sharing using a Bloom filter in Named Data Networking , 2016, 2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[23]  K. Kumar,et al.  A survey on named data networking , 2015, 2015 2nd International Conference on Electronics and Communication Systems (ICECS).

[24]  Hemant Kumar Rath,et al.  Performance evaluation of caching policies in NDN - an ICN architecture , 2016, 2016 IEEE Region 10 Conference (TENCON).

[25]  Mingwei Xu,et al.  Age-based cooperative caching in Information-Centric Networks , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[26]  Liang Liu,et al.  Cache-Aware Named-Data Forwarding in Internet of Things , 2014, GLOBECOM 2014.

[27]  Masao Fuketa,et al.  Trie compact representation using double-array structures with string labels , 2015, 2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA).

[28]  Young-Bae Ko,et al.  On-demand anchor-based mobility support method for named data networking , 2017, 2017 19th International Conference on Advanced Communication Technology (ICACT).

[29]  Jun Li,et al.  A Content Store-Based Module for Congestion Control Algorithms of Named Data Networking , 2016, 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).