ISSN 2996-8223
International Journal of Computer Science and Technology | Vol. 5, No. 5, May 2003 | pp. 33–40
DOI: 10.46882/2003/IJCST/000045
Article Type: Research Article
Title: Enhancing Web Cache Performance Using a Predictive Least Recently Used Replacement Policy
Names of Authors: William H. Vance¹, Aria Montgomery²
Authors’ Affiliations: ¹Department of Computer Science, Stanford University, California, USA; ²Department of Software Engineering, Australian National University, Canberra, Australia
Abstract: The rapid growth of World Wide Web traffic creates significant data bottlenecks, highlighting the need for efficient caching mechanisms to minimize user response latency. Traditional page substitution algorithms, such as Least Recently Used (LRU), fail to account for the structural hyperlink relationships between consecutive web object requests. This study introduces an enhanced Predictive Least Recently Used (P-LRU) replacement policy that integrates a Markov chain model to anticipate future page hits. By tracking historical access sequences, P-LRU preserves high-probability secondary documents in the cache proxy memory before they are explicitly requested. Experimental evaluations utilizing real proxy server access logs comprising 1.5 million requests demonstrated a 12.6% increase in byte hit ratio compared to standard LRU engines. Additionally, the average document latency dropped from 1.84 s down to 1.35 s, optimizing the browsing experience over limited bandwidth dial-up networks.
Keywords: Web Caching, Proxy Servers, Replacement Algorithms, Markov Models, Prefetching, Network Latency
Manuscript Timeline: Received: January 11, 2003; Revised: March 01, 2003; Accepted: April 05, 2003; Published: May 15, 2003
Citation: Vance, W. H., & Montgomery, A. (2003). Enhancing Web Cache Performance Using a Predictive Least Recently Used Replacement Policy. International Journal of Computer Science and Technology, 5(5), 33–40.
Subscribe to read the full article: https://www.internationalscholarsjournals.org/subscribe-to-read