Download:
|
by Edith Cohen, Er Krishnamurthy, Jennifer Rexford
In Proceedings of the 6th European Symposium on Algorithms
http://www.research.att.com/~bala/papers/esa98.ps.gz
Add To MetaCart
Abstract:
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. 1
Citations
|
401
|
Cost-Aware WWW Proxy Caching Algorithms
– Cao, Irani
- 1997
|
|
387
|
A study of replacement algorithms for virtual storage computers. IBMSystems Journal
– Belady
- 1966
|
|
206
|
System Design Issues for Internet Middleware Services: Deduction from a Large Client Trace
– Gribble, Brewer
- 1997
|
|
119
|
Replacement policies for a proxy cache
– Lorenzetti, Rizzo, et al.
|
|
114
|
Competitive paging with locality of reference
– Borodin, Irani, et al.
- 1995
|
|
109
|
Empirical studies of competitive spinning for a sharedmemory multiprocessor
– Karlin, Li, et al.
- 1991
|
|
96
|
Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters
– Cohen, Krishnamurthy, et al.
- 1998
|
|
90
|
Using Speculation to Reduce Server Load and Service Time on the
– Bestavros
- 1995
|
|
68
|
Piggyback Server Invalidation for Proxy Cache Coherency
– Krishnamurthy, Wills
- 1998
|
|
65
|
Adaptive Disk Spindown Via Optimal Rent-to-buy
– Krishnan, Long, et al.
- 1995
|
|
64
|
Study of Piggyback Cache Validation for Proxy Caches
– Krishnamurthy, Wills
- 1997
|
|
64
|
Markov paging
– Karlin, Phillips, et al.
|
|
53
|
On-line file caching
– Young
- 1998
|
|
42
|
An empirical evaluation of virtual circuit holding time policies in IP-over-ATM networks
– Keshav, Lund, et al.
- 1995
|
|
33
|
Experimental studies of access graph based heuristics: Beating the LRU standard
– Fiat, Rosen
- 1997
|
|
27
|
Hinted caching in the web
– Mogul
- 1996
|
|
15
|
Exploiting regularities in Web traffic patterns for cache replacement
– Cohen, Kaplan
- 1999
|
|
15
|
J.C.; "Using predictive prefetching to improve World Wide Web latency
– Padmanabhan, Mogul
- 1996
|
|
9
|
Page replacement with multi-size pages and applications to Web caching
– Irani
- 1997
|
|
6
|
IP over connection oriented networks and distributional paging
– Lund, Reingold, et al.
- 1994
|
|
5
|
Policies for managing TCP connections under persistent HTTP
– Cohen, Kaplan, et al.
- 1999
|
|
1
|
Replacement policies for a proxy cache." http://www.iet.unipi.it/~luigi/lrv98.ps.gz
– Rizzo, Vicisano
- 1998
|