An large number of different caching mechanisms have been previously proposed \mbox{%DIFAUXCMD Aven87,Krunz04,Wikipedia-cache-replacement-policies , 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 Markov model of a generalization of LRU and MRU caching nodes  . Numerical comparisons are made with an "Incremental Rank Progress" (  CLIMB) and random eviction /replacement methods under a  Zipf popularity distribution. The range of cache hit probabilities is smaller under MRU and larger under IRP compared to LRU  .
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 LRU and MRU caching nodes under a reference Markov model . Numerical comparisons are made with an "Incremental Rank Progress" ( IRP a.k.a. CLIMB) and random eviction (a.k.a. random replacement) 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 random-eviction caching tree-network and associated discussion .
R
An large number of
Many
D
\mbox{%DIFAUXCMD Aven87,Krunz04,Wikipedia-cache-replacement-policies
D
Markov model of
A
under a reference Markov model
A
IRP a.k.a.
R
/replacement
(a.k.a. random replacement)
A
steady-state
A
. We conclude with the invariant distribution for a special case of a random-eviction caching tree-network and associated discussion