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.
CITATION STYLE
Vakali, A. I. (2000). LRU-based algorithms for web cache replacement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1875, pp. 409–418). Springer Verlag. https://doi.org/10.1007/3-540-44463-7_36
Mendeley helps you to discover research relevant for your work.