The LCD interconnection of LRU caches and its analysis

Performance Evaluation

Volumn 63, Issue 7, 2006, Pages 609-634

  Laoutaris, Nikolaos ^a   Che, Hao ^b   Stavrakakis, Ioannis ^a  

^a UNIVERSITY OF ATHENS   (Greece)

^b The University of Texas at Arlington   (United States)

Author keywords

Analysis of LRU; Interconnected caches; Web caching

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; ERROR ANALYSIS; MATHEMATICAL MODELS; WORLD WIDE WEB;

ANALYSIS OF LRU; INTERCONNECTED CACHES; WEB CACHING;

CACHE MEMORY;

EID: 33646488504     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2005.05.003     Document Type: Article

References (24)

1. Che H., Tung Y., and Wang Z. Hierarchical web caching systems: modeling, design and experimental results. IEEE J. Selected Areas Commun. 20 7 (2002)
2. Wong T.M., and Wilkes J. My cache or yours? making storage more exclusive. Proceedings of the USENIX Annual Technical Conference. Monterey, CA (2002) 161-175
3. Laoutaris N., Syntila S., and Stavrakakis I. Meta algorithms for hierarchical web caches. Proceedings of the IEEE International Performance Computing and Communications Conference (IEEE IPCCC). Phoenix, Arizona (2004)
4. Podlipnig S., and Böszörmenyi L. A survey of web cache replacement strategies. ACM Comput. Surveys 35 4 (2003) 374-398
5. Ramaswamy L., and Liu L. An expiration age-based document placement scheme for cooperative web caching. IEEE Trans. Knowledge Data Eng. 16 5 (2004) 585-600
6. Mahanti A. Carey Williamson, and Derek Eager, Traffic analysis of a web proxy caching hierarchy. IEEE Network Magazine 14 3 (2000) 16-23
7. Mahanti A., Eager D., and Williamson C. Temporal locality and its impact on web proxy cache performance. Perform. Eval. 42 (2000) 187-203
8. Tang X., and Chanson S.T. Coordinated en-route web caching. IEEE Trans. Comput. 51 6 (2002) 595-607
9. Kang-Won Lee, Sambit Sahu, Khalil Amiri, Chitra Venkatramani, Understanding the potential benefits of cooperation among proxies: Taxonomy and analysis, Technical Report RC22173, IBM Research, 2001.
10. Korupolu M.R., and Dahlin M. Coordinated placement and replacement for large-scale distributed caches. IEEE Trans. Knowledge Data Eng. 14 6 (2002) 1317-1329
11. Breslau L., Cao P., Fan L., Philips G., and Shenker S. Web caching and Zipf-like distributions: Evidence and implications. Proceedings of the Conference on Computer Communications (IEEE Infocom). New York (1999)
12. Chesire M., Wolman A., Voelker G.M., and Levy H.M. Measurement and analysis of a streaming-media workload. Proceedings of the USITS (2001)
13. Saroiu S., Gummadi K.P., Dunn R.J., Gribble S.D., and Levy H.M. An analysis of internet content delivery systems. Proceedings of the fifth Symposium on Operating Systems Design and Implementation (OSDI 2002) (2002)
14. Chen Y., Qiu L., Chen W., Nguyen L., and Katz R.H. Efficient and adaptive web replication using content clustering. IEEE J. Selected Areas Commun. 21 6 (2003)
15. Williamson C. On filter effects in web caching hierarchies. ACM Trans. Internet Technol. vol. 2 1 (2002)
16. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
17. King W.C. Analysis of paging algorithms. Proceedings of the IFIP 1971 Congress. Ljubljana (1972) 485-490
18. Coffman E.G., and Denning P.J. Operating systems theory. Prentice-Hall Inc. (1980)
19. Starobinski D., and Tse D.N.C. Probabilistic methods for web caching. Performance Eval. 46 2-3 (2001) 125-137
20. Flajolet P., Gardy D., and Thimonier L. Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Appl. Math. 39 (1992) 207-229
21. Dan A., and Towsley D. An approximate analysis of the LRU and FIFO buffer replacement schemes. Proceedings of the ACM SIGMETRICS (1990) 143-152
22. Jalenković P.R. Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities. Ann. Appl. Probabil. 9 2 (1999) 430-464
23. Jalenković P.R., and Radovanović A. Asymptotic insensitivity of least-recently-used caching to statistical dependency. Proceedings of the Conference on Computer Communications (IEEE Infocom). San Francisco, CA (2003)
24. Modiano E., and Ephremides A. A method for delay analysis of interacting queues in multiple access systems. Proceedings of the Conference on Computer Communications (IEEE Infocom). San Francisco, CA (1993) 447-454