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.
DOI : 10.1109/tpds.2015.2433296

V. Pacifici and G. Dán, Coordinated Selfish Distributed Caching for Peering Content-Centric Networks, IEEE/ACM Transactions on Networking, vol.24, issue.6, 2016.
DOI : 10.1109/TNET.2016.2541320
URL : http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-180059

S. Shukla and A. A. Abouzeid, On designing optimal memory damage aware caching policies for content-centric networks, 2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp.163-170, 2016.
DOI : 10.1109/WIOPT.2016.7492918

G. Neglia, D. Carra, M. D. Feng, V. Janardhan, P. Michiardi et al., Access-Time Aware Cache Algorithms, 2016 28th International Teletraffic Congress (ITC 28), 2016.
DOI : 10.1109/ITC-28.2016.127
URL : https://hal.archives-ouvertes.fr/hal-01402425

E. N. Young, Encyclopedia of Algorithms, Online Paging and Caching, pp.601-604, 2008.

M. Dehghan, L. Massouliè, D. Towsley, D. Menasche, and Y. Tay, A utility optimization approach to network cache design, IEEE INFOCOM 2016, The 35th Annual IEEE International Conference on Computer Communications, 2016.
DOI : 10.1109/INFOCOM.2016.7524445
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.
DOI : 10.1016/j.comnet.2014.03.006
URL : https://hal.archives-ouvertes.fr/hal-01094694

H. Che, Y. Tung, and Z. Wang, Hierarchical Web caching systems: modeling, design and experimental results, Selected Areas in Communications, pp.1305-1314, 2002.

A. Fiat, R. M. Karp, M. Luby, L. A. Mcgeoch, D. D. Sleator et al., Competitive paging algorithms, Journal of Algorithms, vol.12, issue.4, pp.685-699, 1991.
DOI : 10.1016/0196-6774(91)90041-V
URL : http://arxiv.org/abs/cs/0205038

N. Buchbinder and S. Naor, Online Primal-Dual Algorithms for Covering and Packing Problems, Proc. of 13th Annual European Symposium on Algorithms, 2005.
DOI : 10.1007/11561071_61

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

S. Naor, Primal-dual algorithms for online optimization: Lecture 3

N. E. Young, On-Line File Caching, Algorithmica, vol.33, issue.3, pp.371-383, 2002.
DOI : 10.1007/s00453-001-0124-5

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

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 Transactions on Modeling and Performance Evaluation of Computing Systems, vol.1, issue.3, pp.1-1228, 2016.
DOI : 10.1145/2896380

P. R. Jelenkovic and A. Radovanovic, Optimizing LRU Caching for Variable Document Sizes, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.627-643, 2004.
DOI : 10.1017/S096354830400625X

H. P. Young, The Evolution of Conventions, Econometrica, vol.61, issue.1, pp.57-84, 1993.
DOI : 10.2307/2951778

B. Kauffmann, F. Baccelli, A. Chaintreau, V. Mhatre, K. Papagiannaki et al., Measurement-Based Self Organization of Interfering 802.11 Wireless Access Networks, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1451-1459, 2007.
DOI : 10.1109/INFCOM.2007.171

H. Böckenhauer, D. Komm, R. Královi?, and P. Rossmanith, The online knapsack problem: Advice and randomization, Theoretical Computer Science, vol.527, pp.61-72, 2014.
DOI : 10.1016/j.tcs.2014.01.027

S. M. Ross, Introduction to Stochastic Dynamic Programming: Probability and Mathematical, 1983.

P. J. Laarhoven and E. H. Aarts, Simulated Annealing: Theory and Applications, 1987.
DOI : 10.1007/978-94-015-7744-1

S. Anily and A. Federgruen, Simulated annealing methods with general acceptance probabilities, Journal of Applied Probability, vol.6, issue.03, pp.657-667, 1987.
DOI : 10.2307/1427186

B. Hajek, Cooling Schedules for Optimal Annealing, Mathematics of Operations Research, vol.13, issue.2, 1988.
DOI : 10.1287/moor.13.2.311

J. N. Tsitsiklis, Markov Chains with Rare Transitions and Simulated Annealing, Mathematics of Operations Research, vol.14, issue.1, pp.70-90, 1989.
DOI : 10.1287/moor.14.1.70
URL : http://dspace.mit.edu/bitstream/1721.1/2903/1/P-1497-15587374.pdf

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 Mathematics, vol.1, issue.4, pp.485-509, 2003.
DOI : 10.1080/15427951.2004.10129096

S. Li, J. Xu, M. Van-der-schaar, and W. Li, Popularity-driven content caching, IEEE INFOCOM 2016, The 35th Annual IEEE International Conference on Computer Communications, 2016.
DOI : 10.1109/INFOCOM.2016.7524381

M. Leconte, G. Paschos, L. Gkatzikis, M. Draief, S. Vassilaras et al., Placing dynamic content in caches with small population, IEEE INFOCOM 2016, The 35th Annual IEEE International Conference on Computer Communications, 2016.
DOI : 10.1109/INFOCOM.2016.7524380

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

E. S. Page, CONTINUOUS INSPECTION SCHEMES, Biometrika, vol.41, issue.1-2, pp.100-115, 1954.
DOI : 10.1093/biomet/41.1-2.100
URL : http://biomet.oxfordjournals.org/cgi/content/short/41/1-2/100

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

G. Bianchi and I. Tinnirello, Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network, 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.1208922

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

D. Williams, Probability with Martingales, 1991.
DOI : 10.1017/CBO9780511813658

S. Anily and A. Federgruen, Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods, Operations Research, vol.35, issue.6, pp.867-874, 1987.
DOI : 10.1287/opre.35.6.867

P. Brémaud, Markov chains : Gibbs fields, Monte Carlo simulation and queues, 1999.
DOI : 10.1007/978-1-4757-3124-8