Multidimensional large deviation local limit theorems
Journal of Multivariate Analysis
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
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
On the distribution of search cost for the move-to-front rule
Random Structures & Algorithms
Analyzing client interactivity in streaming media
Proceedings of the 13th international conference on World Wide Web
Optimizing LRU Caching for Variable Document Sizes
Combinatorics, Probability and Computing
IEEE/ACM Transactions on Networking (TON)
Hierarchical replacement decisions in hierarchical stores
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Least-recently-used caching with dependent requests
Theoretical Computer Science
The LCD interconnection of LRU caches and its analysis
Performance Evaluation
Probability Theory with Applications (Mathematics and Its Applications)
Probability Theory with Applications (Mathematics and Its Applications)
A data-oriented (and beyond) network architecture
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
Characterizing Web-Based Video Sharing Workloads
ACM Transactions on the Web (TWEB)
Bandwidth and storage sharing performance in information centric networking
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
A reality check for content centric networking
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Modeling data transfer in content-centric networking
Proceedings of the 23rd International Teletraffic Congress
Performance of the move-to-front algorithm with Markov-modulated request sequences
Operations Research Letters
Hierarchical Web caching systems: modeling, design and experimental results
IEEE Journal on Selected Areas in Communications
Fluid limit analysis of FIFO and RR caching for independent reference models
Performance Evaluation
A versatile and accurate approximation for LRU cache performance
Proceedings of the 24th International Teletraffic Congress
| Hi-index | 0.00 |
The overall performance of content distribution networks as well as recently proposed information-centric networks rely on both memory and bandwidth capacities. 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 (RND). Assuming that requests are independent and identically distributed, general expressions of miss probabilities for a single RND cache are provided as well as exact results for specific popularity distributions (such results also hold for the FIFO replacement policy). Moreover, for any Zipf popularity distribution with exponent @a1, we obtain asymptotic equivalents for the miss probability in the case of large cache size. We extend the analysis to networks of RND 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 neglecting time correlations between miss events at any node; 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 simulation results and shown to be very accurate. Finally, our results enable us to propose recommendations for cache replacement disciplines in a network dedicated to content distribution.