Pp. 193–206 of the Proceedings

Next: Introduction

Cost-Aware WWW Proxy Caching Algorithms

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.

Warning: this HTML version of the paper is generated by LaTex2HTML. LaTex2HTML is not very reliable and has many bugs. We fixed quite a few but not all of them. It is recommended you get the postscript version of the paper as a reliable reference.

• Introduction
• Existing Results
  • Existing Theoretical Results
  • Existing Document Replacement
    Algorithms
    • Implementation Concerns
• Web Proxy Traces
  • Locality in Web Accesses
• GreedyDual-Size Algorithm
  • Proof.
• Performance Comparison
  • Performance Metrics
  • Hit Rate and Byte Hit Rate
  • Reduced Latency
  • Network Costs
  • Summary
• Conclusion
• References
• About this document ...