Web server workload characterization: the search for invariants
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proxy caching that estimates page load delays
Selected papers from the sixth international conference on World Wide Web
Characterizing reference locality in the WWW
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Operating Systems Theory
Sources and Characteristics of Web Temporal Locality
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Optimizing LRU Caching for Variable Document Sizes
Combinatorics, Probability and Computing
Least-recently-used caching with dependent requests
Theoretical Computer Science
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
The persistent-access-caching algorithm
Random Structures & Algorithms
| Hi-index | 0.00 |
It is well known that the static caching algorithm that keeps the most frequently requested documents in the cache is optimal in case when documents are of the same size and requests are independent and identically distributed. However, it is hard to develop explicit and provably optimal caching algorithms when requests are statistically correlated. In this paper, we show that keeping the most frequently requested documents in the cache is still optimal for large cache sizes even if the requests are strongly correlated.