Analysis of a Least Recently Used Cache Management Policy for Web Browsers

Experience shows that document caching by a web browser is a cheap and effective way to improve the performance of the World Wide Web. This study analyzes a LRU (Least Recently Used) policy for cache management in a web browser. In this policy, the cache is filled with documents based upon a documen...

Full description

Saved in:
Bibliographic Details
Published in:Operations research 2002-03, Vol.50 (2), p.345-357
Main Authors: Mookerjee, Vijay S, Tan, Yong
Format: Article
Language:English
Subjects:
Analysis
Approximation
Cache
Cache memory
Caching
Computer software industry
Computers/computer science: system design and operation
Disk caching
Documents
Economic costs
Information systems: analysis and design
Libraries
Library management
Management science
Network servers
Online services
Operations research
Probability: stochastic model applications
Propagation
Propagation delay
Proxy reporting
Proxy statements
Servers
Software
Studies
Theory
Web browsers
World Wide Web
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Experience shows that document caching by a web browser is a cheap and effective way to improve the performance of the World Wide Web. This study analyzes a LRU (Least Recently Used) policy for cache management in a web browser. In this policy, the cache is filled with documents based upon a document's "age," defined as the time elapsed since the document was last accessed. The user's preference for a document is modeled as a general function that declines with the document's age. Two popular measures—the expected delay per document access, and the hit-ratio—are used to evaluate the LRU policy. Unlike many previous studies that evaluate caching policies using simulation methods, this study derives analytical expressions to evaluate performance. The study also presents an approximate, easy-to-compute method to evaluate performance. Numerical tests show this approximation to be extremely accurate. A variety of other numerical results are presented that help describe the behavior ofthe LRU policy under different situations (e.g., when the documents need to be updated periodically). We also compare the LRU policy with other caching policies (both static and dynamic) for small problems. Our comparison suggests that finding a good caching policy that is conscious of document size and delay may be difficult.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.50.2.345.430