Approximate models for general cache networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Rosensweig, Elisha J ^a   Kurose, Jim ^a   Towsley, Don ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MODEL; APPROXIMATION ERRORS; ARBITRARY TOPOLOGY; CACHE NETWORKS; FACTOR ANALYSIS; GAIN INSIGHT; IN-NETWORK; LOW-COMPLEXITY;

APPROXIMATION ALGORITHMS;

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

References (14)

1. B. Ahlgren, M. DAmbrosio, M. Marchisio, I. Marsh, C. Dannewitz, B. Ohlman, K. Pentikousis, O. Strandberg, R. Rembarz, and V. Vercellone, "Design considerations for a network of information," in ReArch'08 Workshop. ACM, 2008.
2. V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, "Networking named content," in CoNEXT. ACM, 2009, pp. 1-12.
3. T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica, "A data-oriented (and beyond) network architecture," in ACM SIGCOMM, 2007.
4. A. Dan and D. F. Towsley, "An approximate analysis of the LRU and FIFO buffer replacement schemes," in SIGMETRICS, 1990, pp. 143-152.
5. H. Che, Z. Wang, and Y. Tung, "Analysis and design of hierarchical web caching systems," in IEEE INFOCOM, 2001, pp. 1416-1424.
6. N. Laoutaris, H. Che, and I. Stavrakakis, "The LCD interconnection of LRU caches and its analysis," Performance Evaluation, vol. 63, pp. 609-634, 2006.
7. E. J. Rosensweig, J. Kurose, and D. Towsley, "Approximate models for general cache networks," UMass Amherst, MA, Tech. Rep. UM-CS-2009-037, 2009.
8. 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.
9. R. Fonseca, V. Almeida, M. Crovella, and B. Abrahao, "On the intrinsic locality properties of web reference streams," in IEEE INFOCOM, 2003.
10. O. Heckmann, M. Piringer, J. Schmitt, and R. Steinmetz, "On realistic network topologies for simulation," in Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research, 2003, pp. 28-32.
11. F. Kelly, "Loss networks," The Annals of Applied Probability, vol. 1, no. 3, pp. 319 - 378, 1991.
12. 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.
13. 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.
14. P. Flajolet, D. Gardy, and L. Thimonier, "Birthday paradox, coupon collectors, caching algorithms and self-organizing search," Discrete Appl. Math., vol. 39, no. 3, pp. 207-229, 1992.