B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman, A survey of information-centric networking, IEEE Communications Magazine, vol.50, issue.7, pp.26-36, 2012.
DOI : 10.1109/MCOM.2012.6231276

S. Albin, Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues, Operations Research, vol.32, issue.5, 1984.
DOI : 10.1287/opre.32.5.1133

D. S. Berger, P. Gland, S. Singla, and F. Ciucu, Exact analysis of TTL cache networks: The case of caching policies driven by stopping times, 1402.

H. Che, Y. Tung, and Z. Wang, Hierarchical web caching systems: modeling, design and experimental results, IEEE JSAC, vol.20, issue.7, pp.1305-1314, 2002.

N. and C. Fofack, On models for performance analysis of a core cache network and power save of a wireless access network, 2014.
URL : https://hal.archives-ouvertes.fr/tel-00968894

N. , C. Fofack, P. Nain, G. Neglia, and D. Towsley, Analysis of ttl-based cache networks, Proc. ValueTools'12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00676735

A. Dan and D. Towsley, An approximate analysis of the lru and fifo buffer replacement schemes, Proc. ACM SIGMETRICS'90, pp.143-152, 1990.

J. A. Fill and L. Holst, On the distribution of search cost for the move-to-front rule. Random Structures Algorithms, pp.179-186, 1996.

N. , C. Fofack, P. Nain, G. Neglia, and D. Towsley, Performance evaluation of hierarchical ttl-based cache networks, Computer Networks, issue.0, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01094694

C. Fricker, P. Robert, and J. Roberts, A versatile and accurate approximation for LRU cache performance, 1202.
URL : https://hal.archives-ouvertes.fr/hal-00671937

M. Gallo, B. Kauffmann, L. Muscariello, A. Simonian, and C. Tanguy, Performance evaluation of the random replacement policy for networks of caches, Performance Evaluation, vol.72, issue.0, pp.16-36, 2014.
DOI : 10.1016/j.peva.2013.10.004
URL : https://hal.archives-ouvertes.fr/hal-01137898

V. Isham, Dependent thinning of point processes, Journal of Applied Probability, vol.1, issue.04, pp.987-995, 1980.
DOI : 10.1214/aop/1176996183

P. R. Jelenkovic and X. Kang, Characterizing the miss sequence of the lru cache. SIGMET- RICS Perform, Eval, vol.36, issue.4, pp.119-121, 2008.

J. Jung, A. W. Berger, and H. Balakrishnan, Modeling TTL-based Internet caches, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003.
DOI : 10.1109/INFCOM.2003.1208693
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.705

N. Laoutaris, A closed-form method for LRU replacement under generalized power-law demand. CoRR, abs/0705, 1970.

N. Laoutaris, S. Syntila, and I. Stavrakakis, Meta algorithms for hierarchical Web caches, IEEE International Conference on Performance, Computing, and Communications, 2004, 2004.
DOI : 10.1109/PCCC.2004.1395054
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1162

A. T. Lawrence, Dependency of intervals between events in superposition processes, Journal of the Royal Statistical Society, Series B (Methodological), vol.35, issue.2, pp.306-315, 1973.

V. Martina, M. Garetto, and E. Leonardi, A unified approach to the performance analysis of caching systems. CoRR, abs/1307, 2013.

N. Melazzi, G. Bianchi, A. Caponi, and A. Detti, A General, Tractable and Accurate Model for a Cascade of LRU Caches, IEEE Communications Letters, vol.18, issue.5, pp.1-4, 2014.
DOI : 10.1109/LCOMM.2014.031414.132727

N. , C. Fofack, and S. Alouf, Modeling modern DNS caches, Proc. ACM Val- ueTools'13, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00907759

B. L. Nelson and I. Gerhardt, On the capturing dependence in point processes: Matching moments and other techniques. Working Paper, 2010.

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

S. Saroiu, K. P. Gummadi, R. J. Dunn, S. D. Gribble, and M. Levy, An analysis of Internet content delivery systems, ACM SIGOPS Operating Systems Review, vol.36, issue.SI, pp.315-327, 2002.
DOI : 10.1145/844128.844158

C. Y. , T. Lam, and J. P. Lehoczky, Superposition of renewal processes, pp.48109-2117, 1990.

S. Traverso, M. Ahmed, M. Garetto, P. Giaccone, E. Leonardi et al., Temporal locality in today's content caching, ACM SIGCOMM Computer Communication Review, vol.43, issue.5, p.43, 2013.
DOI : 10.1145/2541468.2541470

W. Whitt, Approximating a Point Process by a Renewal Process, I: Two Basic Methods, Operations Research, vol.30, issue.1, 1982.
DOI : 10.1287/opre.30.1.125