Probabilistic methods for web caching

DOI10.1016/S0166-5316(01)00045-1MaRDI QIDQ4538457zbMATH OpenWikidataFDO

Authors David Starobinski, D. Tse

Publication date 14 July 2002

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-5316(01)00045-1

zbMATH Keywords

management of web caches

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Optimizing LRU Caching for Variable Document Sizes
• Exploiting regularities in web traffic patterns for cache replacement
• Performance evaluation of Web proxy cache replacement policies
• Web caching using access statistics
• scientific article; zbMATH DE number 1559590

Cited in

(20)

• A birth-death model for Web cache systems: numerical solutions and simulation
• Exploiting regularities in web traffic patterns for cache replacement
• Performance aspects of distributed caches using TTL-based consistency
• On the asymptotic content routing stretch in network of caches: impact of popularity learning
• Web caching using access statistics
• Exploiting regularities in web traffic patterns for cache replacement
• Transient and steady-state regime of a family of list-based cache replacement algorithms
• Markov process analysis for web caching with multiple popularity levels
• The persistent-access-caching algorithm
• Optimal eviction policies for stochastic address traces
• scientific article; zbMATH DE number 2050891 (Why is no real title available?)
• scientific article; zbMATH DE number 1755595 (Why is no real title available?)
• scientific article; zbMATH DE number 1756089 (Why is no real title available?)
• scientific article; zbMATH DE number 1756091 (Why is no real title available?)
• Optimizing LRU Caching for Variable Document Sizes
• scientific article; zbMATH DE number 1930137 (Why is no real title available?)
• scientific article; zbMATH DE number 1869826 (Why is no real title available?)
• Caching with Expiration Times for Internet Applications
• Near optimality of the discrete persistent access caching algorithm
• The subset assignment problem for data placement in caches

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)