Time Aware Least Recent Used (TLRU) cache management policy in ICN

@article{Bilal2014TimeAL,
  title={Time Aware Least Recent Used (TLRU) cache management policy in ICN},
  author={Muhammad Bilal and Shin-Gak Kang},
  journal={16th International Conference on Advanced Communication Technology},
  year={2014},
  pages={528-532}
}
The information centric networks (ICN) can be viewed as a network of caches. Conversely, ICN type of cache networks has distinctive features e.g, contents popularity, usability time of content and other factors inflicts some diverse requirements for cache eviction policies. In this paper we defined four important characteristics of a suitable eviction policy for ICN. We analysed well known eviction policies in view of defined characteristics. Based upon analysis we propose a new eviction scheme… 
A Cache Management Scheme for Efficient Content Eviction and Replication in Cache Networks
TLDR
The CLCE replication scheme reduces the redundant caching of contents; hence improves the cache space utilization and LFRU approximates the least frequently used scheme coupled with the least recently used scheme and is practically implementable for rapidly changing cache networks like ICNs.
Cache replacement positions in information-centric network
TLDR
This study analyzes the intelligence in cache content management to palliate the gross expenses incurred in the ICN practice and recommends replacement strategies to influence the entire cache-hit, stretch and Network diversity.
Contextual dimensions for cache replacement schemes in information-centric networks: a systematic review
TLDR
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.
Randomized Least Frequently Used Cache Replacement Strategy for Named Data Networking
TLDR
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.
Flexpop: A popularity-based caching strategy for multimedia applications in information-centric networking
TLDR
The results show that the FlexPop strategy outperforms LCE, ProbCache, and MPC with respect to cache hit rate, redundancy, content retrieval delay, memory utilization, and stretch ratio, which are regarded as extremely important metrics for the evaluation of ICN caching.
Efficient Caching and Replacement Strategy in Content Centric Network ( CCN ) based on Xon-Path and Hop Count
TLDR
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.
Information-centric mobile caching network frameworks and caching optimization: a survey
TLDR
A brief survey on Information centric mobile caching network architecture and caching optimization is presented, including cache placement in different mobile wireless network architectures, the taxonomy of cache insertion and eviction policies, the modeling behavior of caching networks as well as caching optimization based on network centric and user centric metrics, and typical applications based on mobile caching.
A Query-based Routing Table Update Mechanism for Content-Centric Network
TLDR
This paper presents an alternative solution by designing a query-based routing table update mechanism to increase the accuracy of routing tables by adding an additional query content in interest packets to improve the response time of consumers and network congestion.
...
...

References

SHOWING 1-10 OF 14 REFERENCES
Analysis of TTL-based cache networks
TLDR
This paper introduces a Time-To-Live based policy, that assigns a timer to each content stored in the cache and redraws the timer each time the content is requested (at each hit/miss).
A network calculus for cache networks
TLDR
A network calculus for bounding flows in LRU cache networks of arbitrary topology is developed and several analytical results regarding these systems are derived: the uniformizing impact of LRU on the request stream, and the significance of cache and routing diversity on performance.
Modeling TTL-based Internet caches
  • Jaeyeon JungA. BergerH. Balakrishnan
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
TLDR
A way of modeling the hit rates of caches that use a time-to-live (TTL)-based consistency policy as a function of request arrival times and the choice of TTL, enabling us to better understand cache behavior for shorter TTL periods.
A versatile and accurate approximation for LRU cache performance
TLDR
The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other approaches fail due to the very large populations of cacheable objects to be taken into account and to their complex popularity law.
On the steady-state of cache networks
TLDR
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.
Hierarchical Web caching systems: modeling, design and experimental results
TLDR
Both model-based and real trace simulation studies show that the proposed cooperative architecture results in more than 50% memory saving and substantial central processing unit (CPU) power saving for the management and update of cache entries compared with the traditional uncooperative hierarchical caching architecture.
Illustrating a publish-subscribe Internet architecture
TLDR
The high level architecture developed in the PSIRP project is illustrated, revealing its principles, core components, and basic operations through example usage scenarios and can be considered relevant more generally for publish-subscribe architectures.
Asymptotic insensitivity of least-recently-used caching to statistical dependency
  • P. JelenkovicA. Radovanovic
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
TLDR
The surprising insensitivity of LRU caching performance demonstrates its robustness to changes in document popularity, and the derived asymptotic result and simulation experiments are in excellent agreement, even for relatively small cache sizes.
Aging Th Issues in the Distribution of SIGCOMM
  • 2001
Networking named content
TLDR
Content-Centric Networking (CCN) is presented, which treats content as a primitive - decoupling location from identity, security and access, and retrieving content by name, using new approaches to routing named content.
...
...