Cost-aware WWW proxy caching algorithms

  • Authors:
  • Pei Cao;Sandy Irani

  • Affiliations:
  • Department of Computer Science, University of Wisconsin-Madison;Information and Computer Science Department, University of California-Irvine

  • Venue:
  • USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
  • Year:
  • 1997

Quantified Score

Hi-index 0.02

Visualization

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.