Article ID: | iaor20031881 |
Country: | United States |
Volume: | 50 |
Issue: | 2 |
Start Page Number: | 345 |
End Page Number: | 357 |
Publication Date: | Mar 2002 |
Journal: | Operations Research |
Authors: | Mookerjee Vijay S., Tan Yong |
Keywords: | computational analysis: personal computers |
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 an 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 of the 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.