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 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.

[1]  T. V. Lakshman,et al.  Beyond best effort: router architectures for the differentiated services of tomorrow's Internet , 1998, IEEE Commun. Mag..

[2]  Peter Scheuermann,et al.  A Case for Delay-Conscious Caching of Web Documents , 1997, Comput. Networks.

[3]  Alfred V. Aho,et al.  Principles of Optimal Page Replacement , 1971, J. ACM.

[4]  Azer Bestavros,et al.  Application-level document caching in the Internet , 1995, Second International Workshop on Services in Distributed and Networked Environments.

[5]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  James E. Pitkow,et al.  Yet Robust Caching Algorithm Based on Dynamic Access Patterns , 1994, WWW Spring 1994.

[7]  Gerard Salton,et al.  Dynamic information and library processing , 1975 .

[8]  Ferdinand F. Leimkuhler A literature search and file organization model , 1968 .

[9]  Wei Lin,et al.  Web prefetching between low-bandwidth clients and proxies: potential and performance , 1999, SIGMETRICS '99.

[10]  Philip M. Morse ON BROWSING: THE USE OF SEARCH THEORY IN THE SEARCH FOR INFORMATION , 1970 .

[11]  Bala Srinivasan,et al.  Multi-level browsing for efficient image transmission , 1998, Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130).

[12]  Tzi-cker Chiueh,et al.  Cache memory design for network processors , 2000, Proceedings Sixth International Symposium on High-Performance Computer Architecture. HPCA-6 (Cat. No.PR00550).

[13]  Marc Abrams,et al.  Proxy Caching That Estimates Page Load Delays , 1997, Comput. Networks.

[14]  Gerhard Weikum,et al.  The LRU-K page replacement algorithm for database disk buffering , 1993, SIGMOD Conference.

[15]  Kamran Moinzadeh,et al.  An archiving model for a hierarchical information storage environment , 2000, Eur. J. Oper. Res..

[16]  Roland Peter Wooster,et al.  Optimizing Response Time, Rather than Hit Rates, of WWW Proxy Caches , 1996 .

[17]  Daniel A. Reed,et al.  NCSA's World Wide Web Server: Design and Performance , 1995, Computer.

[18]  Ian H. Witten,et al.  Managing Gigabytes: Compressing and Indexing Documents and Images , 1999 .

[19]  A. K. Jain Sampling in-library book use , 1972, J. Am. Soc. Inf. Sci..

[20]  Edward A. Fox,et al.  Caching Proxies: Limitations and Potentials , 1995, WWW.