, Private communication between P. Jelenkovic and the authors

T. M. , Introduction to Analytic Number eory, 1976.

B. Baccelli and P. Brémaud, Elements of eueing eory: Palm Martingale Calculus and Stochastic Recurrences, Applications of Mathematics, Stochatic Modelling and Applied Probability, vol.26, 2003.

D. S. Berger, P. Gland, S. Singla, and F. Ciucu, Exact analysis of TTL cache networks, Performance Evaluation, vol.79, pp.2-23, 2014.
DOI : 10.1016/j.peva.2014.07.001
URL : http://wrap.warwick.ac.uk/63887/1/WRAP_Ciucu_091_bgsc_exactanalysisofttlcachenetworks_cr.pdf

G. Bianchi, A. Deei, A. Caponi, and N. Blefari-melazzi, Check before storing, ACM SIGCOMM Computer Communication Review, vol.43, issue.3, pp.59-67, 2013.
DOI : 10.1145/2500098.2500106

J. R. Bitner, Heuristics That Dynamically Organize Data Structures, SIAM Journal on Computing, vol.8, issue.1, pp.82-110, 1979.
DOI : 10.1137/0208007

P. J. Burville and J. F. Kingman, On a model for storage and search, Journal of Applied Probability, vol.10, issue.03, pp.697-701, 1973.
DOI : 10.1017/S0021900200094870

H. Che, Y. Tung, and Z. Wang, Hierarchical Web caching systems: modeling, design and experimental results, IEEE Journal on Selected Areas in Communications, vol.20, issue.7, pp.1305-1314, 2002.
DOI : 10.1109/JSAC.2002.801752

N. , C. Fofack, M. Dehghan, D. Towsley, M. Badov et al., On the Performance of General Cache Networks, Proceedings ValueTools 2014. Bratislavia, Slovakia, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01272503

N. , C. Fofack, P. Nain, G. Neglia, and D. Towsley, Performance Evaluation of Hierarchical TTL-based Cache Networks, Computer Networks, vol.65, pp.212-231, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01094694

E. G. Cooman and P. Jelenkovic, Performance of the move-to-front algorithm with Markov-modulated request sequences, Operations Research Leeers, vol.25, pp.109-118, 1999.

A. Dan and D. Towsley, An approximate analysis of the LRU and FIFO buuer replacement schemes, Proc. ACM SIGMETRICS, pp.143-152, 1990.
DOI : 10.1145/98457.98525

M. Dehghan, B. Jiang, A. Dabirmoghaddam, and D. Towsley, On the Analysis of Caches with Pending Interest Tables, Proceedings of the 2nd International Conference on Information-Centric Networking, ICN '15, pp.69-78, 2015.
DOI : 10.1145/2656877.2656887

R. Fagin, Asymptotic miss ratios over independent references, Journal of Computer and System Sciences, vol.14, issue.2, pp.222-250, 1977.
DOI : 10.1016/S0022-0000(77)80014-7
URL : https://doi.org/10.1016/s0022-0000(77)80014-7

A. Ferragut, I. Rodríguez, and F. Paganini, Optimizing TTL caches under heavy-tailed demands, Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp.101-112, 2016.
DOI : 10.1145/2964791.2901459

P. Flajolet, D. Gardy, and L. Imonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

C. Fricker, P. Robert, and J. Roberts, A Versatile and Accurate Approximation for LRU Cache Performance, Proceedings of the 24th International Teletraac Congress, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00671937

M. Gareeo, E. Leonardi, and V. Martina, A Uniied Approach to the Performance Analysis of Caching Systems, ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), vol.1, issue.3, 2016.

N. Gast and B. Van-houdt, TTL approximations of the cache replacement algorithms LRU(m) and h-LRU. Performance Evaluation (2017), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01292269

R. Hirade and T. Osogami, Analysis of page replacement policies in the uid limit, Operations research, vol.58, pp.4-5, 2010.

P. Jelenkovic and A. Radovanovi´cradovanovi´c, Least-recently-used caching with dependent requests, Theoretical Computer Science, vol.326, issue.1-3, pp.293-327, 2004.
DOI : 10.1016/j.tcs.2004.07.029

P. Jelenkovic, A. Radovanovi´cradovanovi´c, and M. Squillante, Critical sizing of LRU caches with dependent requests, Journal of Applied Probability, vol.1, issue.04, pp.1013-1027, 2006.
DOI : 10.1002/(SICI)1098-2418(199605)8:3<179::AID-RSA2>3.0.CO;2-V

P. R. Jelenkovi´cjelenkovi´c, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, Annals of Applied Probability, pp.430-464, 1999.

W. F. King, Analysis of demand paging algorithm, Information Processing, vol.71, pp.485-490, 1972.

E. Leonardi and G. L. Torrisi, Modeling LEAST RECENTLY USED caches with Shot Noise request processes, SIAM Journal on Applied Mathematics, vol.77, issue.2, pp.361-383, 2017.
DOI : 10.1137/15M1041444

M. Lò-eve, Probability eory I, Graduate Texts in Mathematics, vol.45, 1977.

T. Osogami, A fluid limit for a cache algorithm with general request processes, Advances in Applied Probability, vol.33, issue.03, pp.816-833, 2010.
DOI : 10.1016/S0167-6377(99)00037-1

E. J. Rosensweig, J. Kurose, and D. Towsley, Approximate Models for General Cache Networks, 2010 Proceedings IEEE INFOCOM, pp.1100-1108, 2010.
DOI : 10.1109/INFCOM.2010.5461936