A. Araldo, D. Rossi, and F. Martignon, Cost-aware caching: Caching more (costly items) for less (ISPs operational expenditures)," Parallel and Distributed Systems, IEEE Trans. on, vol.27, issue.5, pp.1316-1330, 2016.

V. Pacifici and G. Dán, Coordinated selfish distributed caching for peering content-centric networks, IEEE/ACM Trans. on Networking, 2016.

S. Shukla and A. A. Abouzeid, On designing optimal memory damage aware caching policies for content-centric networks, Proc. of WiOpt, pp.163-170, 2016.

G. Neglia, D. Carra, M. D. Feng, V. Janardhan, P. Michiardi et al., Access-time aware cache algorithms, Proc. of ITC-28, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01402425

E. N. Young, Encyclopedia of Algorithms, pp.601-604, 2008.

M. Dehghan, L. Massoulié, D. Towsley, D. Menasche, and Y. Tay, A Utility Optimization Approach to Network Cache Design, Proc. of IEEE INFOCOM 2016, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01377841

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

A. Fiat, R. M. Karp, M. Luby, L. A. Mcgeoch, D. D. Sleator et al., Competitive paging algorithms, Journal of Algorithms, vol.12, pp.685-699, 1991.

N. Buchbinder and S. Naor, Online primal-dual algorithms for covering and packing problems, Proc. of 13th Annual European Symposium on Algorithms (ESA 2005), 2005.

S. Albers, Competitive online algorithms, BRIC, Lecture Series LS, pp.96-98, 1996.

N. E. Young, On-line file caching, Algorithmica, vol.33, issue.3, pp.371-383, 2002.

P. Cao and S. Irani, Cost-aware www proxy caching algorithms, Proc. of the USENIX USITS, 1997.

R. Fagin, Asymptotic miss ratios over independent references, Journal of Computer and System Sciences, vol.14, issue.2, pp.222-250, 1977.

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

C. Fricker, P. Robert, and J. Roberts, A versatile and accurate approximation for LRU cache performance, Proceedings of the 24th International Teletraffic Congress, p.8, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00671937

M. Garetto, E. Leonardi, and V. Martina, A unified approach to the performance analysis of caching systems, ACM Trans. Model. Perform. Eval. Comput. Syst, vol.1, issue.3, p.28, 2016.

P. R. Jelenkovic and A. Radovanovic, Optimizing LRU Caching for Variable Document Sizes, Comb. Probab. Comput, vol.13, issue.4-5, pp.627-643, 2004.

H. P. Young, The Evolution of Conventions, Econometrica, vol.61, issue.1, pp.57-84, 1993.

B. Kauffmann, F. Baccelli, A. Chaintreau, V. Mhatre, K. Papagiannaki et al., Measurement-based self organization of interfering 802.11 wireless access networks, Proc. of IEEE INFOCOM, pp.1451-1459, 2007.

H. Böckenhauer, D. Komm, R. Královi?, and P. Rossmanith, The online knapsack problem: Advice and randomization, Theor. Comput. Sci, vol.527, pp.61-72, 2014.

, Simulated Annealing: Theory and Applications, 1987.

S. Anily and A. Federgruen, Simulated Annealing method with general acceptance probabilities, Journal of Applied Probability, vol.24, issue.3, pp.657-667, 1987.

B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research, vol.13, 1988.

J. N. Tsitsiklis, Markov chains with rare transitions and simulated annealing, Math. Oper. Res, vol.14, issue.1, pp.70-90, 1989.

H. Young, Individual Strategy and Social Structure: An Evolutionary Theory of Institutions, 2001.

A. Broder and M. Mitzenmacher, Network applications of bloom filters: A survey, Internet Math, vol.1, issue.4, pp.485-509, 2003.

S. Li, J. Xu, M. Van-der-schaar, and W. Li, Popularity-driven content caching, Proc. of IEEE INFOCOM 2016, 2016.

M. Leconte, G. Paschos, L. Gkatzikis, M. Draief, S. Vassilaras et al., Placing dynamic content in caches with small population, Proc. of IEEE INFOCOM 2016, 2016.

G. Bianchi, K. Duffy, D. J. Leith, and V. Shneer, Modeling conservative updates in multi-hash approximate count sketches, Proc. of ITC-24, 2012.

E. S. Page, Continuous Inspection Schemes, Biometrika, vol.41, issue.1-2, pp.100-115, 1954.

P. Granjon, The CUSUM algorithm a small review, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00914697

K. Shah, A. Mitra, and D. Matani, An O(1) algorithm for implementing the LFU cache eviction scheme, 2010.

D. Williams, Probability with Martingales, 1991.

S. Anily and A. Federgruen, Ergodicity in parametric non stationary Markov chains: An application to simulated annealing methods, Operations Research, vol.35, issue.6, pp.867-874, 1987.

P. Brémaud, Markov chains : Gibbs fields, Monte Carlo simulation and queues, 1999.

M. Basseville and I. V. Nikiforov, Detection of Abrupt Changes: Theory and Application, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00008518