|
USENIX Symposium on Internet Technologies and Systems, 1997
Cost-Aware WWW Proxy Caching Algorithms
Pei Cao, Univeristy of Wisconsin, Madison
Sandy Irani, University of California, Irvine
Abstract
Web caches can not only reduce network traffic and downloading latency, but can
also affect the distribution of web traffic over the network through
cost-aware caching.
This paper introduces GreedyDual-Size, which incorporates locality with
cost and size concerns in a simple and non-parameterized fashion for high
performance. Trace-driven simulations show that with the appropriate cost
definition, GreedyDual-Size outperforms existing web cache replacement
algorithms in many aspects, including hit ratios, latency reduction and
network cost reduction. In addition, GreedyDual-Size can potentially
improve the performance of main-memory caching of Web documents.
- View the full text of this paper in
HTML form and
PDF form.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
- To become a USENIX Member, please see our Membership Information.
|
Need help? Use our Contacts page.
Technical Program