Probabilistic methods for web caching
From MaRDI portal
Publication:4538457
DOI10.1016/S0166-5316(01)00045-1zbMATH Open1013.68012WikidataQ127125121 ScholiaQ127125121MaRDI QIDQ4538457FDOQ4538457
Authors: David Starobinski, D. Tse
Publication date: 14 July 2002
Published in: Performance Evaluation (Search for Journal in Brave)
Recommendations
Cited In (19)
- Title not available (Why is that?)
- Exploiting regularities in web traffic patterns for cache replacement
- A birth-death model for Web cache systems: numerical solutions and simulation
- Title not available (Why is that?)
- Exploiting regularities in web traffic patterns for cache replacement
- Caching with Expiration Times for Internet Applications
- Title not available (Why is that?)
- The subset assignment problem for data placement in caches
- Optimizing LRU Caching for Variable Document Sizes
- Near optimality of the discrete persistent access caching algorithm
- Performance aspects of distributed caches using TTL-based consistency
- Transient and steady-state regime of a family of list-based cache replacement algorithms
- Title not available (Why is that?)
- Web caching using access statistics
- The persistent-access-caching algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal eviction policies for stochastic address traces
- Markov process analysis for web caching with multiple popularity levels
This page was built for publication: Probabilistic methods for web caching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4538457)