scholarly journals Information-Centric Networking Cache Placement Method Based on Cache Node Status and Location

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Dapeng Man ◽  
Yao Wang ◽  
Hanbo Wang ◽  
Jiafei Guo ◽  
Jiguang Lv ◽  
...  

Information-Centric Networking with caching is a very promising future network architecture. The research on its cache deployment strategy is divided into three categories, namely, noncooperative cache, explicit collaboration cache, and implicit collaboration cache. Noncooperative caching can cause problems such as high content repetition rate in the web cache space. Explicit collaboration caching generally reflects the best caching effect but requires a lot of communication to satisfy the exchange of cache node information and depends on the controller to perform the calculation. On this basis, implicit cooperative caching can reduce the information exchange and calculation between cache nodes while maintaining a good caching effect. Therefore, this paper proposes an on-path implicit cooperative cache deployment method based on the dynamic LRU-K cache replacement strategy. This method evaluates the cache nodes based on their network location and state and selects the node with the best state value on the transmission path for caching. Each request will only select one or two nodes for caching on the request path to reduce the redundancy of the data. Simulation experiments show that the cache deployment method based on the state and location of the cache node can improve the hit rate and reduce the average request length.

2015 ◽  
Vol 10 (6) ◽  
pp. 620 ◽  
Author(s):  
Prapai Sridama ◽  
Somchai Prakancharoen ◽  
Nalinpat Porrawatpreyakorn
Keyword(s):  

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.


IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 27010-27017 ◽  
Author(s):  
Tinghuai Ma ◽  
Yu Hao ◽  
Wenhai Shen ◽  
Yuan Tian ◽  
Mznah Al-Rodhaan

IEEE Network ◽  
2020 ◽  
Vol 34 (6) ◽  
pp. 126-132
Author(s):  
Boubakr Nour ◽  
Hakima Khelifi ◽  
Hassine Moungla ◽  
Rasheed Hussain ◽  
Nadra Guizani

Sign in / Sign up

Export Citation Format

Share Document