Neighbor-Referencing Cooperative Cache Policy in Content-Centric Network

2013 ◽  
Vol 433-435 ◽  
pp. 1702-1708
Author(s):  
Guo Yin Zhang ◽  
Bin Tang ◽  
Xiang Hui Wang ◽  
Yan Xia Wu
Keyword(s):  
Cache Replacement ◽  
Replacement Algorithm ◽  
Cooperative Cache ◽  
Replacement Process ◽  
Content Popularity ◽  
Simulation Results ◽  
Content Centric Network ◽  
Key Aspects

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.

An Advanced LRU Cache Replacement Strategy for Content-Centric Network

2013 ◽  
Vol 462-463 ◽  
pp. 884-890
Author(s):  
Bin Tang ◽  
Guo Yin Zhang ◽  
Zhi Jing Xing ◽  
Yan Xia Wu ◽  
Xiang Hui Wang
Keyword(s):  
Network Performance ◽  
Cache Replacement ◽  
Effective Utilization ◽  
Replacement Strategy ◽  
Replacement Algorithm ◽  
Replacement Process ◽  
Content Centric Network ◽  
Key Aspects ◽  
Data Request ◽  
Cache Block

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 contents of the cache and its neighbor nodes in the cache replacement process, which bring worthless cache block in the cache and reduce the efficiency of the cache. An enhanced LRU cache replacement strategy has been proposed, which can replace the cache block in time that is not requested from other nodes and improve the rate of effective utilization of the cache space. Simulation results show that the A-LRU strategy increases cache hit rate, shortens the data request delay and improves overall network performance, verifies the validity of the A-LRU strategies in CCN.

scholarly journals An Unifying Replacement Approach for Caching Systems

2007 ◽  
Vol 3 (4) ◽  
pp. 256
Author(s):  
Kai-Hau Yeung ◽  
Kin-Yeung Wong
Keyword(s):  
Cache Replacement ◽  
Single System ◽  
Unified Approach ◽  
Web Documents ◽  
Hit Rate ◽  
Replacement Algorithm ◽  
Different Types ◽  
Simulation Results ◽  
Video Documents

A cache replacement algorithm called probability based replacement (PBR) is proposed in this paper. The algorithm makes replacement decision based on the byte accessprobabilities of documents. This concept can be applied to both small conventional web documents and large video documents. The performance of PBR algorithm is studied by both analysis and simulation. By comparing cache hit probability, hit rate and average time spent in three systems, it is shown that the proposed algorithm outperforms the commonly used LRU and LFU algorithms. Simulation results show that, when large video documents are considered, the PBR algorithm provides up to 120% improvement in cache hit rate when comparing to that ofconventional algorithms. The uniqueness of this work is that, unlike previous studies that propose different solutions for different types of documents separately, the proposed PBR algorithm provides a simple and unified approach to serve different types of documents in a single system.

An Aggregation Cache Replacement algorithm based on ontology clustering

2006 ◽  
Vol 11 (5) ◽  
pp. 1141-1146
Author(s):  
Zhu Jiang ◽  
Shen Qingguo ◽  
Tang Tang ◽  
Li Yongqiang
Keyword(s):  
Cache Replacement ◽  
Replacement Algorithm

scholarly journals Intelligent data cache based on content popularity and user location for Content Centric Networks

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Hsin-Te Wu ◽  
Hsin-Hung Cho ◽  
Sheng-Jie Wang ◽  
Fan-Hsun Tseng
Keyword(s):  
Data Cache ◽  
Total Size ◽  
Hit Rate ◽  
Cache Size ◽  
Content Popularity ◽  
Content Centric Network ◽  
Cache Scheme ◽  
And Storage ◽  
User Location ◽  
Content Cache

AbstractContent cache as well as data cache is vital to Content Centric Network (CCN). A sophisticated cache scheme is necessary but unsatisfied currently. Existing content cache scheme wastes router’s cache capacity due to redundant replica data in CCN routers. The paper presents an intelligent data cache scheme, viz content popularity and user location (CPUL) scheme. It tackles the cache problem of CCN routers for pursuing better hit rate and storage utilization. The proposed CPUL scheme not only considers the location where user sends request but also classifies data into popular and normal content with correspond to different cache policies. Simulation results showed that the CPUL scheme yields the highest cache hit rate and the lowest total size of cache data with compared to the original cache scheme in CCN and the Most Popular Content (MPC) scheme. The CPUL scheme is superior to both compared schemes in terms of around 8% to 13% higher hit rate and around 4% to 16% lower cache size. In addition, the CPUL scheme achieves more than 20% and 10% higher cache utilization when the released cache size increases and the categories of requested data increases, respectively.

Sign in / Sign up

Export Citation Format

Share Document