Abstract
New demands brought by the continuing growth of the Internet will be met in part by more effective and comprehensive use of caching. This paper proposes to exploit client browser caches in the context of cooperative proxy caching by constructing the client caches within each organization (e.g., corporate networks) as a peer-to-peer (P2P) client cache. Via trace-driven simulations we evaluate the potential performance benefit of cooperative proxy caching with/without exploiting client caches. We show that exploiting client caches in cooperative proxy caching can significantly improve performance, particularly when the size of individual proxy caches is limited compared to the universe of Web objects. We further devise a cooperative hierarchical greedy-dual replacement algorithm (Hier-GD), which not only provides some cache coordination but also utilizes client caches. Through Hier-GD, we explore the design issues of how to exploit client caches in cooperative proxy caching to build large Web caches. We show that Hier-GD is technically practical and can potentially improve the performance of cooperative proxy caching by utilizing client caches.
Similar content being viewed by others
References
Bloom BH, (1970) Space/time trade-offs in hash coding with allowable errors, Commun ACM 13(7):422–426
Breslau L, Cao P, Fan L, Phillips G, Shenker S (1999) Web caching and Zipf-like distributions: Evidence and implications, In: Proceedings of the INFOCOM ’99 conference, Mar 1999
Busari M, Williamson CL (2001) On the sensitivity of web proxy cache performance to workload characteristics. In: Proceedings of IEEE INFOCOM, Anchorage, Apr 2001, pp 1225–1234
Cao P, Irani S (1997) Cost-aware WWW proxy caching algorithms. In: Proceedings of the 1997 usenix symposium on internet technologies and systems (USITS-97), Monterey, Dec 1997
Chankhunthod A, Danzig PB, Neerdaels C, Schwartz MF, Worrell KJ (1996) A hierarchical internet object cache. In: Proceedings of the 1996 USENIX annual technical conference, Jan 1996, pp 153–164.
Dykes SG, Robbins KA (2001) A viability analysis of cooperative proxy caching, In: Proceedings of the INFOCOM ’01 conference, Apr 2001, pp 1205–1214
Fan L, Cao P, Almeida J, Broder AZ (2000) Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Trans Netw 8(June):281–293
Gadde S, Rabinovich M, Chase JS (1996) Reduce, reuse, recycle: An approach to building large internet caches. In: Proceedings of the workshop on hot topics in operating systems, May 1996, pp 93–98
Iyer S, Rowstron A, Druschel P (2002) Squirrel: A decentralized peer-to-peer web cache. In: Proceedings of the 21st symposium on principles of distributed computing (PODC), Monterey, CA, July 2002
Korupolu MR, Dahlin M (1999) Coordinated placement and replacement for large-scale distributed caches. In: Proceedings of the 1999 IEEE workshop on internet applicatons, July 1999, pp 62–71
Krishnamurthy B, Wills CE (1997) Study of piggyback cache validation for proxy caches in the World Wide Web. In: Proceedings of the 1997 usenix symposium on internet technologies and systems (USITS-97), Dec 1997
Krishnamurthy B, Wills CE (1998) Piggyback server invalidation for proxy cache coherency. In: Proceedings of the 7th international WWW conference, Brisbane, Australia, Apr 1998
Krishnan P, Sugla B (1998) Utility of co-operating Web proxy caches. In: Proceedings of the 7th international WWW conference, Brisbane, Australia, Apr 1998
Lee K-W, Sahu S, Amiri K, Venkatramani C (2001) Understanding the potential benefits of cooperation among proxies: Taxonomy and analysis, Tech Rep, IBM Research Report, Sept
“Mangosoft cachelink.” http://www.mangosoft.com/products/cachelink
Michel S, Nguyen K, Rosenstein A, Zhang L, Floyd S, Jacobson V (1998) Adaptive Web caching: towards a new global caching architecture. Comput Netw ISDN Syst 30(Nov):2169–2177
Rabinovich M, Chase J, Gadde S (1998) Not all hits are created equal: Cooperative proxy caching over a wide-area network. In: Proceedings of the third international WWW caching workshop, June 1998
Ratnasamy S, Francis P, Handley M, Karp R, Shenker (2001) A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, San Diego, Aug 2001, pp 161–172
Rousskov A, Wessels D (1998) Cache digests, In: Proceedings of the 3rd international WWW caching workshop, June 1998
Rowstron A, Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM international conference on distributed system platforms (middleware), Heidelberg, Nov 2001, pp 329–350
Rowstron A, Druschel P (2001) Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proceedings of the 18th ACM symposium on operating systems principles (SOSP ’01), Banff, Canada, Oct 2001, pp 188–201
Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM, San Diego, Aug 2001, pp 149–160
Tewari R, Dahlin M, Vin HM, Kay JS (1999) Design considerations for distributed caching on the internet. In: Proceedings of the 19th international conference on distributed computing systems, May 1999, pp 273–284
Touch J (1998) The LSAM proxy cache—a multicast distributed virtual cache. In: Proceedings of the third international WWW caching workshop, June 1998
Uc berkeley home ip web traces (1997) http://ita.ee.lbl.gov/html/contrib/UCB.home-IP-HTTP.html, June
Wolman A, Voelker G, Sharma N, Cardwell N, Karlin A, Levy H (1999) On the scale and performance of cooperative Web proxy caching. In: Proceedings of the 17th ACM symposium on operating systems principles (SOSP’99), Dec 1999, pp 16–31
Young NE (1998) On-line file caching. In: Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms, San Francisco, Jan 1998, pp 78–81
Zhao BY, Kubiatowicz JD, Joseph AD (2001) Tapestry: An infrastructure for fault-tolerance wide-area location and routing, Tech Rep UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley, Apr
Author information
Authors and Affiliations
Corresponding author
Additional information
Expanded version of a talk presented in Proceedings of ICPP’03. This work is supported in part by the National Science Foundation under Career Award CCR-9984852 and ACI-0232647, and the Ohio Board of Regents.
Rights and permissions
About this article
Cite this article
Zhu, Y., Hu, Y. Exploiting client caches to build large Web caches. J Supercomput 39, 149–175 (2007). https://doi.org/10.1007/s11227-007-0108-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-007-0108-6