Abstract
To reduce user-perceived latency in retrieving documents on the world wide web, a commonly used technique is caching both at the client’s browser and more gainfully (due to sharing) at a proxy. The effectiveness of Web caching hinges on the replacement policy that determines the relative value of caching different objects. An important component of such policy is to predict next-request times. We propose a caching policy utilizing statistics on resource inter-request times. Such statistics can be collected either locally or at the server, and piggybacked to the proxy. Using various Web server logs, we compared existing cache replacement policies with our server-assisted schemes. The experiments show that utilizing the server knowledge of access patterns can greatly improve the effectiveness of proxy caches. Our experimental evaluation and proposed policies use a price function framework. The price function values the utility of a unit of cache storage as a function of time. Instead of the usual tradeoffs of profit (combined value of cache hits) and cache size we measure tradeoffs of profit and caching cost (average allocated cache portion). The price-function framework allows us to evaluate and compare different replacement policies by using server logs, without having to construct a full workload model for each client’s cache.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Cao and S. Irani, “Cost-aware WWW proxy caching algorithms,” in Proceedings of the USENIX Symposium on Internet Technologies and Systems, December 1997. http://www.cs.wisc.edu/~cao/papers/gd-size.html.
S. Irani, “Page replacement with multi-size pages and applications to web caching,” in Proc. 29th Annual ACM Symposium on Theory of Computing, 1997.
N. Young, “On line file caching,” in Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1998.
L. Rizzo and L. Vicisano, “Replacement policies for a proxy cache,” tech. rep., University of Pisa, January 1998. http://www.iet.unipi.it/~luigi/lrv98.ps.gz.
J. C. Mogul, “Hinted caching in the web,” in Proceedings of the 1996 SIGOPS European Workshop, 1996. http://mosquitonet.stanford.edu/sigops96/papers/mogul.ps.
E. Cohen, B. Krishnamurthy, and J. Rexford, “Improving end-to-end performance of the Web using server volumes and proxy filters,” in Proceedings of ACM SIGCOMM, September 1998. http://www.research.att.com/~bala/papers/sigcomm98.ps.gz.
B. Krishnamurthy and C. E. Wills, “Study of piggyback cache validation for proxy caches in the world wide web,” in Proceedings of the USENIX Symposium on Internet Technologies and Systems, December 1997. http://www.research.att.com/~bala/papers/pcv-usits97.ps.gz.
B. Krishnamurthy and C. E. Wills, “Piggyback server invalidation for proxy cache coherency,” in Proceedings of the World Wide Web-7 Conference, April 1998. http://www.research.att.com/~bala/papers/psi-www7.ps.gz.
L. A. Belady, “A study of replacement algorithms for virtual storage computers,” IBM Systems Journal, vol. 5, pp. 78–101, 1966.
S. D. Gribble and E. A. Brewer, “System design issues for Internet middleware services: Deductions from a large client trace,” in Proceedings of the USENIX. Symposium on Internet Technologies and Systems, December 1997. http://www.usenix.org/events/usits97.
A. Borodin, S. Irani, P. Raghavan, and B. Schieber, “Competitive paging with locality of reference,” in Proc. 23rd Annual ACM Symposium on Theory of Computing, 1991.
A. Karlin, S. Phillips, and P. Raghavan, “Markov paging,” in Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, IEEE, 1992.
C. Lund, N. Reingold, and S. Phillips, “IP over connection oriented networks and distributional paging,” in Proc. 35th IEEE Annual Symposium on Foundations of Computer Science, 1994.
S. Keshav, C. Lund, S. Phillips, N. Reingold, and H. Saran, “An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks,” Journal on Selected Areas in Communications, vol. 13, October 1995. http://www.cs.cornell.edu/skeshav/doc/94/2-16.ps.
A. Fiat and Z. Rosen, “Experimental studies of access graph based heuristics: Beating the LRU standard?,” in Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, 1997.
A. Bestavros, “Using speculation to reduce server load and service time on the WWW,” in Proceedings of the ACM 4th International Conference on Information and Knowledge Management, 1995. http://www.cs.bu.edu/faculty/best/res/papers/Home.html.
V. N. Padmanabhan and J. C. Mogul, “Using predictive prefetching to improve world wide web latency,” Computer Communication Review, vol. 26, no. 3, pp. 22–36, 1996. http://daedalus.cs.berkeley.edu/publications/ccr-july96.ps.gz.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, E., Krishnamurthy, B., Rexford, J. (1998). Evaluating Server-Assisted Cache Replacement in the Web. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-68530-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64848-2
Online ISBN: 978-3-540-68530-2
eBook Packages: Springer Book Archive