PBRS: A Content Popularity and Betweenness Based Cache Replacement Scheme in ICN-IoT

2021 ◽  
Vol 22 (7) ◽  
pp. 1495-1508
Author(s):  
Ying Liu Ying Liu ◽  
Ting Zhi Ying Liu ◽  
Huachun Zhou Ting Zhi ◽  
Haidong Xi Huachun Zhou

2021 ◽  
Author(s):  
Muhammad Jaseemuddin

In this thesis, we proposed a Cluster-Based Cache Replacement (CBR) scheme for 5G Networks to reduce the backhaul traffic. We developed our scheme based on the understanding of the degradation of the performance of the cache placement algorithm. We expect that whenever file request pattern differs from the file popularity distribution, such as unpopular files become more popular or vice versa, the caching system should experience performance degradation. We address this problem by presenting a cache replacement scheme based on the idea of Least Frequency Used (LFU) replacement policy, but we consider only the recent request to avoid cache pollution. We evaluated the performance of CBR through simulation and compared its performance with LRU that is widely used as a cache replacement technique in practice. We simulated three different configurations of LRU scheme in a cluster-based mobile network model. Our simulation results show that the CBR outperforms LRU, where it reduces the miss ratio from 86% to 76% and the backhaul traffic from 3.67×105 to 3.47×105 MB with 10% of cache size. This superior performance it achieves by fewer replacement decisions and storing more files in the cache.


2012 ◽  
Vol 40 (1) ◽  
pp. 235-246 ◽  
Author(s):  
Hyojun Kim ◽  
Moonkyung Ryu ◽  
Umakishore Ramachandran

2013 ◽  
Vol 433-435 ◽  
pp. 1702-1708
Author(s):  
Guo Yin Zhang ◽  
Bin Tang ◽  
Xiang Hui Wang ◽  
Yan Xia Wu

In-network caching is one of the key aspects of content-centric networks (CCN), while the cache replacement algorithm of LRU does not consider the relation between the cache contents and its neighbor nodes in the cache replacement process, which reduced the efficiency of the cache. In this paper, a Neighbor-Referencing Cooperative Cache Policy (NRCCP) in CCN has been proposed to check whether the neighbors have cached the content. Node will cache the content while none of its neighbors has cached it, therefore reduce redundancy of cached content and increase the variety of contents. Simulation results show that NRCCP has better performance, as the network path had more caching ability and more content popularity densely distributed.


Sign in / Sign up

Export Citation Format

Share Document