We obtain the ] ] stationary invariant distribution of a Markov model of a LRU cache assuming a capacity in terms of a fixed number of objects .
An large number of different caching mechanisms have been previously proposed 1], 3], exploring different insertion and eviction policies, and the performance of networks of them have been analyzed in different ways. We review stationary Markovian models of caching networks with independent incident (data) object demand processes and independent storing decisions (object insertion) and forwarding decisions (owing to cache misses) by the caches. We obtain a novel closed-form stationary invariant distribution for LRU and MRU caching nodes, and numerically compare with a simple "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU .
R
We obtain the
An large number of different caching mechanisms have been previously proposed
A
1
A
,
A
3
A
, exploring different insertion and eviction policies, and the performance of networks of them have been analyzed in different ways. We review stationary Markovian models of caching networks with independent incident (data) object demand processes and independent storing decisions (object insertion) and forwarding decisions (owing to cache misses) by the caches. We obtain a novel closed-form
R
of a Markov model of a LRU cache assuming a capacity in terms of a fixed number of objects
for LRU and MRU caching nodes, and numerically compare with a simple "Incremental Rank Progress" caching mechanism where cache hits result in slower progress through the ranks than LRU