LRU-based Algorithms for Web Cache Replacement

  • Authors:
  • Athena Vakali

  • Affiliations:
  • -

  • Venue:
  • EC-WEB '00 Proceedings of the First International Conference on Electronic Commerce and Web Technologies
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Caching has been introduced and applied in prototype and commercial Web-based information systems in order to reduce the overall bandwidth and increase system's fault tolerance. This paper presents a track of Web cache replacement algorithms based on the Least Recently Used (LRU) idea. We propose an extension to the conventional LRU algorithm by considering the number of references to Web objects as a critical parameter for the cache content replacement. The proposed algorithms are validated and experimented under Web cache traces provided by a major Squid proxy cache server installation environment. Cache and bytes hit rates are reported showing that the proposed cache replacement algorithms improve cache content.