Probabilistic methods for web caching

Performance Evaluation

Volumn 46, Issue 2-3, 2001, Pages 125-137

  Starobinski, David ^a   Tse, David ^b  

^a Boston University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Independent reference model; Probabilistic method; Web caching

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTER SIMULATION; PACKET NETWORKS; PROBABILISTIC LOGICS;

WEB CACHING;

WORLD WIDE WEB;

EID: 0035480137     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(01)00045-1     Document Type: Article

References (18)

1. Caching on the world wide web
2. World wide web caching: Trends and techniques
3. Web caching and Zipf-like distributions: Evidence and implications
4. Cost-aware WWW proxy caching algorithms
5. Improving proxy cache performance
6. The measured access characteristics of world wide web client proxy caches
7. Some distribution-free aspects of paging algorithm performance
8. A unified approach to the evaluation of a class of replacement algorithms
9. An account of self-organizing systems
10. Self-organizing linear search
11. Analysis of paging algorithms
12. Algorithms from P to NP
13. A randomized web cache replacement scheme