Analysis of a least recently used cache management policy for web browsers

Operations Research

Volumn 50, Issue 2, 2002, Pages 345-357

  Mookerjee, Vijay S ^a   Tan, Yong ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; OPERATIONS RESEARCH; WORLD WIDE WEB;

CACHE MANAGEMENT; LEAST RECENTLY USED (LRU) POLICY;

WEB BROWSERS;

EID: 0036508157     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.2.345.430     Document Type: Article

References (30)

1. Caching proxies: Limitations and potentials
2. Principles of optimal page replacement
3. Application-level document caching in the Internet
4. Web caching and zipf-like distributions: Evidence and implications
5. The broadband era: The new opportunities and challenges for the network capacity explosion
6. Cache memory design for network processors
7. Web prefetching between low-bandwidth clients and proxies: Potential and performance
8. The great yuletide shakeout
9. Caching goes ca-ching! why caching companies have become so important
10. Sampling in-library book use
11. Beyond best effort: Router architectures for the differentiated services of tomorrow's Internet
12. NCSA's world wide web server: Design and performance
13. Multi-level browsing for efficient image transmission
14. A literature search and file organization model
15. The web is no shopper's paradise
16. Evaluating web-server capacity
17. An archival model for hierarchical information storage management
18. On browsing: The use of search theory in the search for information
19. The LRU-K page replacement algorithm for database disk buffering
20. A simple, yet robust caching algorithm based on dynamic access patterns
21. A case for delayconscious caching of web documents
22. Proxy caching that estimates page load delays