A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks

  title={A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks},
  author={Muhammad Bilal and Shin-Gak Kang},
  journal={IEEE Access},
To cope with the ongoing changing demands of the internet, ‘in-network caching’ has been presented as an application solution for two decades. With the advent of information-centric network (ICN) architecture, ‘in-network caching’ becomes a network level solution. Some unique features of the ICNs, e.g., rapidly changing cache states, higher request arrival rates, smaller cache sizes, and other factors, impose diverse requirements on the content eviction policies. In particular, eviction… 

Figures from this paper

A New Efficient Cache Replacement Strategy for Named Data Networking
  • Saad Al-Ahmadi
  • Computer Science
    International journal of Computer Networks & Communications
  • 2021
This paper introduces a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks.
Randomized Least Frequently Used Cache Replacement Strategy for Named Data Networking
This paper proposes a content replacement scheme for ICN, called Randomized LFU that is implemented with respect to content popularity taking the time complexity into account and achieves encouraging results in terms of the cache hit ratio, inner hit, and hit distance.
A Resource Efficient Multi-Dimensional Cache Management Strategy in Content Centric Networks
An adaptive caching strategy, named as Multi-Attribute Caching Strategy (MACS) based on multi-parameters for CCN is proposed, which attempts to overcome inefficient cache utilization by intelligently selecting caching locations along the content delivery path.
A Cache Replication Strategy Based on Betweenness and Edge Popularity in Named Data Networking
By evaluating BEP and other cache replication strategies on a virtual topology, it is indicated that BEP can achieve higher performance in terms of the cache hit ratio, server load and average delay.
A popularity based content eviction scheme via betweenness-centrality caching approach for content-centric networking (CCN)
A novel popularity based content eviction scheme for CCN with evaluation of local popularity of a content using the betweenness-centrality concept is presented and the simulation results recommend that the proposed scheme can reliably accomplish the better performance across the other approaches proposed in this field.
Contextual dimensions for cache replacement schemes in information-centric networks: a systematic review
An extensive study of the ICN literature is conducted through a Systematic Literature Review (SLR) process to map reported evidence of different aspects of context regarding the cache replacement schemes and contribute to the understanding of what is a context from the perspective of cache replacement policies and the context characteristics that influence cache behavior.
Modified Floyd Warshall Algorithm for Cache Management in Information Centric Network
A new shortest path estimation algorithm (Modified Floyd Warshall Algorithm (MFWA) was developed to identify the shortest path in each subnet for retrieving the cache memory data quickly and improved cache hit ratio up to 4-30% as related to the existing methods.
Hit Ratio and Latency Optimization for Caching Systems: A Survey
This study systematically and extensively survey the most recent caching techniques that were published and critically analyze their target in detail by performance metrics, including hit ratio, latency, and storage efficiency.
NDN Content Store and Caching Policies: Performance Evaluation
Evaluating and comparing the behavior of four caching policies applied to named data networking, i.e., random, least recently used (LRU), least frequently used (LFU), and first in first out (FIFO), applied to NDN finds LRU presents better performance in all considered metrics.
Efficient Caching and Replacement Strategy in Content Centric Network ( CCN ) based on Xon-Path and Hop Count
This paper proposes a caching and replacement strategies for content in Content-Centric Network (CCN), where the caching strategy will choose the node that will be cached on based on the network topology and the replacement strategy will take in its consideration the number of resources that thecontent has been consumed and if the content has been requested recently or not.


Probabilistic in-network caching for information-centric networks
The results show reduction of up to 20% in server hits, and up to 10% in the number of hops required to hit cached contents, but, most importantly, reduction of cache-evictions by an order of magnitude in comparison to universal caching.
In-Network Cache Management and Resource Allocation for Information-Centric Networks
The proposed probabilistic approach to in-network caching exhibits ideal performance both in terms of network resource utilization and in termsof resource allocation fairness among competing content flows.
Cache "Less for More" in Information-Centric Networks
A centrality-based caching algorithm is proposed by exploiting the concept of (ego network) betweenness centrality to improve the caching gain and eliminate the uncertainty in the performance of the simplistic random caching strategy.
Time Aware Least Recent Used (TLRU) cache management policy in ICN
This paper defined four important characteristics of a suitable eviction policy for ICN and proposed a new eviction scheme which is well suitable forICN type of cache networks.
Experimental Evaluation of Memory Management in Content-Centric Networking
This paper implements a set of storage management techniques in the open source CCNx prototype and performs extensive experiments in a real testbed under fairly realistic network conditions, allowing to clarify the relation between CCN chunk-level caching and Quality of Experience (QoE) perceived by end users.
On the effects of caching in access aggregation networks
An analytical model of an aggregation access network receiving a continuous flow of requests from external clients is developed and provided, which enables it to provide guidelines and rules of thumb for operators and Information-Centric Network designers.
Impact of traffic mix on caching performance in a content-centric network
Results demonstrate that caching VoD in access routers offers a highly favorable bandwidth memory tradeoff but that the other types of content would likely be more efficiently handled in very large capacity storage devices in the core.
On the steady-state of cache networks
This work demonstrates that certain cache networks are non-ergodic in that their steady-state characterization depends on the initial state of the system, and establishes several important properties of cache networks, in the form of three independently-sufficient conditions for a cache network to comprise a single ergodic component.