LRU-based algorithms for Web Cache Replacement

TitleLRU-based algorithms for Web Cache Replacement
Publication TypeConference Paper
Year of Publication2000

Caching has been introduced and applied in prototype andcommercial Web-based information systems in order to reduce the overallbandwidth and increase system’s fault tolerance. This paper presents atrack of Web cache replacement algorithms based on the Least RecentlyUsed (LRU) idea. We propose an extension to the conventional LRUalgorithm by considering the number of references to Web objects as acritical parameter for the cache content replacement. The proposed algorithmsare validated and experimented under Web cache traces providedby a major Squid proxy cache server installation environment. Cache andbytes hit rates are reported showing that the proposed cache replacementalgorithms improve cache content.


auth logo

Location & Contact

Department of Informatics
Aristotle University of Thessaloniki
Thessaloniki GR-54124

t  | (+30) 2310 998415
e |