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

Kesidis, G. (2018). Stationary Distribution of a Generalized LRU-MRU Content Cache. In 2018 International Conference on Computing, Networking and Communications, ICNC 2018 (pp. 676-681). (2018 International Conference on Computing, Networking and Communications, ICNC 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCNC.2018.8390281
Kesidis, George. / Stationary Distribution of a Generalized LRU-MRU Content Cache. 2018 International Conference on Computing, Networking and Communications, ICNC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 676-681 (2018 International Conference on Computing, Networking and Communications, ICNC 2018).
@inproceedings{bc61d503bb2c42079cf7d14d999cb625,
title = "Stationary Distribution of a Generalized LRU-MRU Content Cache",
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.",
author = "George Kesidis",
year = "2018",
month = "6",
day = "19",
doi = "10.1109/ICCNC.2018.8390281",
language = "English (US)",
series = "2018 International Conference on Computing, Networking and Communications, ICNC 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "676--681",
booktitle = "2018 International Conference on Computing, Networking and Communications, ICNC 2018",
address = "United States",

}

Kesidis, G 2018, Stationary Distribution of a Generalized LRU-MRU Content Cache. in 2018 International Conference on Computing, Networking and Communications, ICNC 2018. 2018 International Conference on Computing, Networking and Communications, ICNC 2018, Institute of Electrical and Electronics Engineers Inc., pp. 676-681, 2018 International Conference on Computing, Networking and Communications, ICNC 2018, Maui, United States, 3/5/18. https://doi.org/10.1109/ICCNC.2018.8390281

Stationary Distribution of a Generalized LRU-MRU Content Cache. / Kesidis, George.

2018 International Conference on Computing, Networking and Communications, ICNC 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 676-681 (2018 International Conference on Computing, Networking and Communications, ICNC 2018).

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

TY - GEN

T1 - Stationary Distribution of a Generalized LRU-MRU Content Cache

AU - Kesidis, George

PY - 2018/6/19

Y1 - 2018/6/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85050105449&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050105449&partnerID=8YFLogxK

U2 - 10.1109/ICCNC.2018.8390281

DO - 10.1109/ICCNC.2018.8390281

M3 - Conference contribution

AN - SCOPUS:85050105449

T3 - 2018 International Conference on Computing, Networking and Communications, ICNC 2018

SP - 676

EP - 681

BT - 2018 International Conference on Computing, Networking and Communications, ICNC 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Kesidis G. Stationary Distribution of a Generalized LRU-MRU Content Cache. In 2018 International Conference on Computing, Networking and Communications, ICNC 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 676-681. (2018 International Conference on Computing, Networking and Communications, ICNC 2018). https://doi.org/10.1109/ICCNC.2018.8390281