On the scale and performance
of cooperative Web proxy caching

Alec Wolman, Geoffrey M. Voelker, Nitin Sharma,
Neal Cardwell, Anna Karlin, and Henry M. Levy


While algorithms for cooperative proxy caching have been widely studied, little is understood about cooperative-caching performance in the large-scale World Wide Web environment. This paper uses both trace-based analysis and analytic modelling to show the potential advantages and drawbacks of inter-proxy cooperation. With our traces, we evaluate quantitatively the performance-improvement potential of cooperation between 200 small-organization proxies within a university environment, and between two large-organization proxies handling 23,000 and 60,000 clients, respectively. With our model, we extend beyond these populations to project cooperative caching behavior in regions with millions of clients. Overall, we demonstrate that cooperative caching has performance benefits only within limited population bounds. We also use our model to examine the implications of future trends in Web-access behavior and traffic.

[PS], [PS.GZ], [PDF]

In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP '99), pages 16-31, Kiawah Island Resort, SC, USA, December, 1999.

Published as Operating Systems Review 34(5):16-31, December 1999.