Performance evaluation of the random replacement policy for networks of caches

This publication has 27 references indexed in Scilit:

• Characterizing Web-Based Video Sharing Workloads
  ACM Transactions on the Web, 2011
• Characterizing the miss sequence of the LRU cache
  ACM SIGMETRICS Performance Evaluation Review, 2008
• Analysis of Enterprise Media Server Workloads: Access Patterns, Locality, Content Evolution, and Rates of Change
  IEEE/ACM Transactions on Networking, 2004
• Least-recently-used caching with dependent requests
  Theoretical Computer Science, 2004
• Hierarchical Web caching systems: modeling, design and experimental results
  IEEE Journal on Selected Areas in Communications, 2002
• Performance of the move-to-front algorithm with Markov-modulated request sequences
  Operations Research Letters, 1999
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
  The Annals of Applied Probability, 1999
• An approximate analysis of the LRU and FIFO buffer replacement schemes
  ACM SIGMETRICS Performance Evaluation Review, 1990
• On a model for storage and search
  Journal of Applied Probability, 1973
• The stationary distribution of an interesting Markov chain
  Journal of Applied Probability, 1972