An Optimal Cache Placement Strategy Based on Content Popularity in Content Centric Network

2014 ◽  
Vol 11 (8) ◽  
pp. 2759-2769 ◽  
Author(s):  
Guoyin Zhang
Keyword(s):  
Content Popularity ◽  
Cache Placement ◽  
Content Centric Network

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.

Replacement based content popularity and cache gain for 6G Content-Centric network

2021 ◽  
Vol 44 ◽  
pp. 101238
Author(s):  
Yancheng Ji ◽  
Xiao Zhang ◽  
Wenfei Liu ◽  
Guoan Zhang
Keyword(s):  
Content Popularity ◽  
Content Centric Network

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.

scholarly journals Cache pressure-aware caching scheme for content-centric networking

2019 ◽  
pp. 795-806
Author(s):  
XI LUO ◽  
YING AN
Keyword(s):  
Cache Replacement ◽  
Average Response ◽  
Replacement Rate ◽  
Content Centric Networking ◽  
The Core ◽  
Caching Scheme ◽  
Content Popularity ◽  
Cache Efficiency ◽  
Network Transmission ◽  
Cache Placement

Content centric networking (CCN) is a new networking paradigm to meet the growing demand for content access in the future. Because of its important role in accelerating content retrieval and reducing network transmission load, in-network caching has become one of the core technologies in CCN and has attracted wide attention. The existing caching schemes often lack sufficient consideration of node cache status and the temporal validity of user requests, and thus the cache efficiency of the network is greatly reduced. In this paper, a cache pressure-aware caching scheme is proposed, which comprehensively takes into account various factors such as content popularity, cache occupancy rate, cache replacement rate, and the validity period of the Interest packet to achieve reasonable cache placement and replacement. Simulation results show that the proposed scheme effectively improves the cache hit rate and the resource utilization while decreasing the average response hops.

scholarly journals Efficient Caching for Data-Driven IoT Applications and Fast Content Delivery with Low Latency in ICN

2019 ◽  
Vol 9 (22) ◽  
pp. 4730 ◽  
Author(s):  
Kamrul Hasan ◽  
Seong-Ho Jeong
Keyword(s):  
Network Architecture ◽  
Low Latency ◽  
Data Intensive ◽  
Iot Applications ◽  
Content Retrieval ◽  
Current Location ◽  
Content Popularity ◽  
Content Centric Network ◽  
Content Availability ◽  
Caching Mechanism

Edge computing is a key paradigm for the various data-intensive Internet of Things (IoT) applications where caching plays a significant role at the edge of the network. This paradigm provides data-intensive services, computational activities, and application services to the proximity devices and end-users for fast content retrieval with a very low response time that fulfills the ultra-low latency goal of the 5G networks. Information-centric networking (ICN) is being acknowledged as an important technology for the fast content retrieval of multimedia content and content-based IoT applications. The main goal of ICN is to change the current location-dependent IP network architecture to location-independent and content-centric network architecture. ICN can fulfill the needs for caching to the vicinity of the edge devices without further storage deployment. In this paper, we propose an architecture for efficient caching at the edge devices for data-intensive IoT applications and a fast content access mechanism based on new clustering and caching procedures in ICN. The proposed cluster-based efficient caching mechanism provides the solution to the problem of the existing hash and on-path caching mechanisms, and the proposed content popularity mechanism increases the content availability at the proximity devices for reducing the content transfer time and packet loss ratio. We also provide the simulation results and mathematical analysis to prove that the proposed mechanism is better than other state-of-the-art caching mechanisms and the overall network efficiencies are increased.

Sign in / Sign up

Export Citation Format

Share Document