Performance evaluation of the random replacement policy for networks of caches

@inproceedings{Gallo2012PerformanceEO,
  title={Performance evaluation of the random replacement policy for networks of caches},
  author={Massimo Gallo and Bruno Kauffmann and Luca Muscariello and Alain Simonian and Christian Tanguy},
  booktitle={SIGMETRICS},
  year={2012}
}
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… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
0 Extracted Citations
0 Extracted References
Similar Papers

Similar Papers

Loading similar papers…