L. Breslau, Web caching and Zipf-like distributions: evidence and implications, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), pp.126-134, 1999.
DOI : 10.1109/INFCOM.1999.749260
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2253

C. D. Cairano-gilfedder and R. G. Clegg, A decade of Internet research ??? advances in models and practices, BT Technology Journal, vol.15, issue.5, pp.115-128, 2005.
DOI : 10.1002/047120644X

H. Che, Z. Wang, and Y. Tung, Analysis and design of hierarchical Web caching systems, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.1416-1424, 2001.
DOI : 10.1109/INFCOM.2001.916637

R. G. Clegg, C. D. Cairano-gilfedder, and S. Zhou, A critical look at power law modelling of the Internet, Computer Communications, vol.33, issue.3, pp.259-268, 2009.
DOI : 10.1016/j.comcom.2009.09.009

A. Dan and D. Towsley, An approximate analysis of the lru and fifo buffer replacement schemes, pp.143-15290, 1990.

S. Floyd, A reliable multicast framework for light-weight sessions and application level framing, IEEE/ACM Transactions on Networking, vol.5, issue.6, pp.784-803, 1997.
DOI : 10.1109/90.650139
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1027

N. Fujita, Y. Ishikawa, A. Iwata, and R. Izmailov, Coarse-grain replica management strategies for dynamic replication of Web contents, Computer Networks, vol.45, issue.1, 2004.
DOI : 10.1016/j.comnet.2004.02.006

P. R. Jelenkovic, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, The Annals of Applied Probability, vol.9, issue.2, 1999.
DOI : 10.1214/aoap/1029962750

P. R. Jelenkovi´cjelenkovi´c 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. R. Jelenkovi´cjelenkovi´c, A. Radovanovi´cradovanovi´c, and M. S. 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

M. F. Neuts, Matrix-Geometric Solutions to Stochastic Models, 1981.
DOI : 10.1007/978-3-642-69546-9_91

G. Pallis and A. Vakali, Insight and perspectives for content delivery networks, Communications of the ACM, vol.49, issue.1, pp.101-106, 2006.
DOI : 10.1145/1107458.1107462
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.6750

S. Ratnasamy, A. Ermolinskiy, and S. Shenker, Revisiting IP multicast, SIG- COMM '06, pp.15-26, 2006.
DOI : 10.1145/1159913.1159917
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.380.2531

E. J. Rosensweig and J. Kurose, Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.2631-2635, 2009.
DOI : 10.1109/INFCOM.2009.5062201
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.8823

E. J. Rosensweig, J. Kurose, and D. Towsley, Approximate Models for General Cache Networks, 2010 Proceedings IEEE INFOCOM, 2010.
DOI : 10.1109/INFCOM.2010.5461936
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.810