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
Modeling data transfer in content-centric networking
Proceedings of the 23rd International Teletraffic Congress
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
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
A versatile and accurate approximation for LRU cache performance
Proceedings of the 24th International Teletraffic Congress
On the performance of bandwidth and storage sharing in information-centric networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Caching is a key component for Content Distribution Networks and new Information-Centric Network architectures. In this paper, we address performance issues of caching networks running the RND replacement policy. We first prove that when the popularity distribution follows a general power-law with decay exponent α 1, the miss probability is asymptotic to O( C1-α) for large cache size C. We further evaluate network of caches under RND policy for homogeneous tree networks and extend the analysis to tandem cache networks where caches employ either LRU or RND policies.