LRU Cache under Stationary Requests

Abstract In this paper we extend an approximation first proposed by Fagin [4] for the LRU cache under the independence reference model to systems where requests for different contents form independent stationary and ergodic processes. We show that this approximation becomes exact as the number of contents goes to infinity while maintaining the fraction of the contents that can populate the cache to be constant. Last, we provide results on the rate of convergence.
  • Bo Jiang (UMass)
  • Philippe Nain
  • Don Towsley (UMass)
Date Jun-2017
Venue 2017 Workshop on MAthematical performance Modeling and Analysis