On the steady-state of cache networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 863-871

  Rosensweig, Elisha J ^a   Menasche, Daniel S ^b   Kurose, Jim ^a  

^a The Manning College of Information and Computer Sciences   (United States)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE NETWORKS; CACHE REPLACEMENT; CACHE REPLACEMENT POLICY; CACHING SYSTEM; CENTRAL COMPONENT; CONTENT-CENTRIC NETWORKINGS; ERGODIC COMPONENTS; NETWORKING MODEL;

EQUIVALENCE CLASSES;

EID: 84883056237     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6566874     Document Type: Conference Paper

References (34)

1. V. Jacobson, D. K. Smetters, N. H. Briggs, M. F. Plass, P. Stewart, J. D. Thornton, and R. L. Braynard, Voccn: voice-over content-centric networks, in Proceedings of the 2009 workshop on Re-architecting the internet, ser. ReArch 09. New York, NY, USA: ACM, 2009, pp. 1-6.
2. V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, Networking named content, in CONEXT. NY: ACM, 2009, pp. 1-12.
3. K. Pentikousis and T. Rautio, A multiaccess network of information, in World of Wireless Mobile and Multimedia Networks (WoWMoM), 2010 IEEE International Symposium on a, june 2010, pp. 1-9.
4. K. Katsaros, G. Xylomenos, and G. Polyzos, A hybrid overlay multicast and caching scheme for information-centric networking, in INFOCOM, march 2010, pp. 1-6.
5. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, A scalable content-addressable network, SIGCOMM Comput. Commun. Rev., vol. 31, no. 4, pp. 161-172, 2001.
6. E. Rosensweig and J. Kurose, Breadcrumbs: efficient, best-effort content location in cache networks, in INFOCOM, 2009.
7. D. Trossen, M. Sarela, and K. Sollins, Arguments for an informationcentric internetworking architecture, SIGCOMM Comput. Commun. Rev., vol. 40, pp. 26-33, April 2010.
8. G. Peng, Cdn: Content distribution network, ArXiv, 2004. [Online]. Available: http://arxiv.org/abs/cs/0411069
9. L. Qiu, V. Padmanabhan, and G. Voelker, On the placement of web server replicas, in INFOCOM, vol. 3, 2001, pp. 1587-1596 vol.3.
10. N. Laoutaris, H. Che, and I. Stavrakakis, The LCD interconnection of LRU caches and its analysis, Performance Evaluation, vol. 63, pp. 609-634, 2006.
11. M. Busari and C. L. Williamson, Simulation evaluation of a heterogeneous web proxy caching hierarchy, in MASCOTS. IEEE Computer Society, 2001, pp. 379-388.
12. L. Breslau, P. Cue, P. Cao, L. Fan, G. Phillips, and S. Shenker, Web caching and zipf-like distributions: Evidence and implications, in INFOCOM, 1999, pp. 126-134.
13. W. F. King, Analysis of paging algorithms, in IFIP Congress, 1971, pp. 485-490.
14. A. Dan and D. F. Towsley, An approximate analysis of the lru and fifo buffer replacement schemes, in SIGMETRICS, 1990, pp. 143-152.
15. R. Fonseca, V. Almeida, M. Crovella, and B. Abrahao, On the intrinsic locality properties of web reference streams, in INFOCOM, 2003.
16. S. Ioannidis and P. Marbach, On the design of hybrid peer-to-peer systems, in SIGMETRICS, 2008.
17. S. Tewari and L. Kleinrock, Proportional replication in peer-to-peer networks, in INFOCOM, april 2006, pp. 1-12.
18. E. Rosensweig, J. Kurose, and D. Towsley, Approximate models for general cache networks, in INFOCOM, march 2010, pp. 1-9.
19. H. Che, Z. Wang, and Y. Tung, Analysis and design of hierarchical web caching systems, in INFOCOM, 2001, pp. 1416-1424.
20. M. G. Giovanna Carogli, L. Muscariello, and D. Perino, Modeling data transfer in content-centric networking, France Tel., Tech. Rep., 2011.
21. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peer-to-peer networks, in International Conference on Supercomputing, ser. ICS 02. New York, NY: ACM, 2002, pp. 84-95.
22. S. Ioannidis and P. Marbach, Absence of evidence as evidence of absence, in INFOCOM, 2009.
23. J. Kemeny and J. Snell, Finite Markov Chains. Springer, 1976.
24. I. Ari, Design and management of globally distributed network caches, Ph.D. dissertation, UC Santa Cruz, 2004.
25. Y. Zhou, Z. Chen, and K. Li, Second-level buffer cache management, Parallel and Distributed Systems, IEEE Transactions on, vol. 15, no. 6, pp. 505-519, june 2004.
26. A. Bhide, A. Dan, and D. Dias, A simple analysis of the lru buffer policy and its relationship to buffer warm-up transient, in International Conference on Data Engineering, apr 1993, pp. 125-133.
27. S. Borst, V. Gupta, and A. Walid, Distributed caching algorithms for content distribution networks, in INFOCOM, march 2010, pp. 1-9.
28. R. Gupta, S. Tokekar, and D. Mishra, A paramount pair of cache replacement algorithms on l1 and l2 using multiple databases with security, in Emerging Trends in Engineering and Technology (ICETET), 2009 2nd International Conference on, dec. 2009, pp. 346-351.
29. I. Psaras, R. G. Clegg, R. Landa, W. K. Chai, and G. Pavlou, Modeling and evaluation of ccn-caching trees, in IFIP Networking, 2011.
30. M. Gallo, B. Kauffmann, L. Muscariello, A. Simonian, and C. Tanguy, Performance evaluation of the random replacement policy for networks of caches, ACM SIGMETRICS Performance Evaluation Review, vol. 40, pp. 395-396, 2012.
31. A. Panagakis, A. Vaios, and I. Stavrakakis, Approximate analysis of lru in the case of short term correlations, Comput. Netw., vol. 52, no. 6, pp. 1142-1152, 2008.
32. H. Levy and R. J. T. Morris, Exact analysis of bernoulli superposition of streams into a least recently used cache, IEEE Trans. Softw. Eng., vol. 21, no. 8, pp. 682-688, 1995.
33. X. Tang and S. T. Chanson, Coordinated en-route web caching, IEEE Transactions on Computers, vol. 51, no. 6, pp. 595-607, 2002.
34. M. R. Korupolu and M. Dahlin, Coordinated placement and replacement for large-scale distributed caches, IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 6, pp. 1317-1329, 2002.