Performance of the move-to-front algorithm with Markov-modulated request sequences

Coffman, E. G.; Jelenković, Predrag R.

doi:10.1016/s0167-6377(99)00037-1

Cited by 15 publications

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

Sugimoto

Miyoshi

2005

Random Struct Algorithms

View full text Add to dashboard Cite

ABSTRACT:We consider the least-recently-used cache replacement rule with a Zipf-type page request distribution and investigate an asymptotic property of the fault probability with respect to an increase of cache size. We first derive the asymptotics of the fault probability for the independentrequest model and then extend this derivation to a general dependent-request model, where our result shows that under some weak assumptions the fault probability is asymptotically invariant with regard to dependence in the page request process. In a previous study, a similar result was derived by applying a Poisson embedding technique, where a continuous-time proof was given through some assumptions based on a continuous-time modeling. The Poisson embedding, however, is just a technique used for the proof and the problem is essentially on a discrete-time basis; thus, it is preferable to make assumptions, if any, directly in the discrete-time setting. We consider a general dependent-request model and give a direct discrete-time proof under different assumptions. A key to the proof is that the numbers of requests for respective pages represent conditionally negatively associated random variables.

show abstract

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

Sugimoto

Miyoshi

2005

Random Struct Algorithms

View full text Add to dashboard Cite

show abstract

Untitled

Balister

Bollobás

Kozma

2006

Random Struct Algorithms

View full text Add to dashboard Cite

Performance evaluation of the random replacement policy for networks of caches

Gallo¹,

Kauffmann

Muscariello

et al. 2014

Performance Evaluation

View full text Add to dashboard Cite

The overall performance of content distribution networks as well as recently proposed information-centric networks rely on both memory and bandwidth capacities. In this framework, the hit ratio is the key performance indicator which captures the bandwidth / memory tradeoff for a given global performance. This paper focuses on the estimation of the hit ratio in a network of caches that employ the Random replacement policy. Assuming that requests are independent and identically distributed, general expressions of miss probabilities for a single Random cache are provided as well as exact results for specific popularity distributions. Moreover, for any Zipf popularity distribution with exponent α > 1, we obtain asymptotic equivalents for the miss probability in the case of large cache size. We extend the analysis to networks of Random caches, when the topology is either a line or a homogeneous tree. In that case, approximations for miss probabilities across the network are derived by assuming that miss events at any node occur independently in time; the obtained results are compared to the same network using the Least-Recently-Used discipline, already addressed in the literature. We further analyze the case of a mixed tandem cache network where the two nodes employ either Random or Least-Recently-Used policies. In all scenarios, asymptotic formulas and approximations are extensively compared to simulations and shown to perform very well. Finally, our results enable us to propose recommendations for cache replacement disciplines in a network dedicated to content distribution. These results also hold for a cache using the First-In-First-Out policy.

show abstract

Performance of the move-to-front algorithm with Markov-modulated request sequences

Cited by 15 publications

References 13 publications

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

Untitled

Performance evaluation of the random replacement policy for networks of caches

Contact Info

Product

Resources

About