An approximate analysis of the LRU and FIFO buffer replacement schemes
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On the distribution of search cost for the move-to-front rule
Random Structures & Algorithms
Understanding user behavior in large-scale video-on-demand systems
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Youtube traffic characterization: a view from the edge
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Characterizing the miss sequence of the LRU cache
ACM SIGMETRICS Performance Evaluation Review
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
IEEE Transactions on Computers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Approximate models for general cache networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Performance evaluation of the random replacement policy for networks of caches
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Hierarchical Web caching systems: modeling, design and experimental results
IEEE Journal on Selected Areas in Communications
Traffic analysis of a Web proxy caching hierarchy
IEEE Network: The Magazine of Global Internetworking
ACM SIGCOMM Computer Communication Review
Temporal locality in today's content caching: why it matters and how to model it
ACM SIGCOMM Computer Communication Review
Performance evaluation of the random replacement policy for networks of caches
Performance Evaluation
| Hi-index | 0.00 |
In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy. The approximation proves remarkably accurate and is applicable to quite general distributions of object popularity. This paper provides a mathematical explanation for the success of the approximation, notably in configurations where the intuitive arguments of Che et al. clearly do not apply. The approximation is particularly useful in evaluating the performance of current proposals for an information centric network where other approaches fail due to the very large populations of cacheable objects to be taken into account and to their complex popularity law, resulting from the mix of different content types and the filtering effect induced by the lower layers in a cache hierarchy.