Stationary Distribution of a Generalized LRU-MRU Content Cache

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Many different caching mechanisms have been previously proposed, exploring different insertion and eviction policies and their performance individually and as part of caching networks. We obtain a novel closed-form stationary invariant distribution for a generalization of Least Recently Used (LRU) and Most Recently Used (MRU) eviction for single caching nodes under a reference Markov model. Numerical comparisons are made with an 'Incremental Rank Progress' (IRP a.k.a. CLIMB) and random eviction (RE a.k.a. random replacement, RANDOM) methods under a steady-state Zipf popularity distribution. The range of cache hit probabilities is smaller under MRU and larger under IRP compared to LRU. We conclude with the invariant distribution for a special case of a RE caching tree-network.

Original languageEnglish (US)
Title of host publication2018 International Conference on Computing, Networking and Communications, ICNC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages676-681
Number of pages6
ISBN (Electronic)9781538636527
DOIs
StatePublished - Jun 19 2018
Event2018 International Conference on Computing, Networking and Communications, ICNC 2018 - Maui, United States
Duration: Mar 5 2018Mar 8 2018

Publication series

Name2018 International Conference on Computing, Networking and Communications, ICNC 2018

Other

Other2018 International Conference on Computing, Networking and Communications, ICNC 2018
CountryUnited States
CityMaui
Period3/5/183/8/18

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this