Before revision: 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 .
After revision: We obtain the ] ], 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 of a Markov model of a LRU cache assuming a capacity in terms of a fixed number of objects .