Optimizing LRU caching for variable document sizes

Combinatorics Probability and Computing

Volumn 13, Issue 4-5, 2004, Pages 627-643

  Jelenković, Predrag R ^a   Radovanović, Ana ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; MATHEMATICAL MODELS; MULTIMEDIA SYSTEMS; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; WORLD WIDE WEB;

LEAST RECENTLY USED (LRU) CACHE; RANDOMIZATION PROBABILITIES; WEB CACHING;

CACHE MEMORY;

EID: 6344284209     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830400625X     Document Type: Conference Paper

References (13)

1. Almeida, V., Bestavros, A., Crovella, M. and de Oliviera, A. (1996) Characterizing reference locality in the WWW. In Proc. Fourth International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, December 1996.
2. Cao, P. and Irani, S. (1997) Cost-aware WWW proxy caching algorithms. In Proc. USENIX 1997 Annual Technical Conference, Anaheim, California, January 1997.
3. Fill, J. A. (1996) An exact formula for the move-to-front rule for self-organizing lists. J. Theoret. Probab. 9113-159.
4. Fill, J. A. and Holst, L. (1996) On the distribution of search cost for the move-to-front rule. Random Struct. Alg. 8 179-186.
5. Flajolet, P., Gardy, D. and Thimonier, L. (1992) Birthday paradox, coupon collector, caching algorithms and self-organizing search. Discrete Appl. Math. 39 207-229.
6. Irani, S. (2002) Page replacement with multi-size pages and applications to Web caching. Algorithmica 33 384-409.
7. Jelenković, P. R. (1999) Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities. Ann. Appl. Probab. 9 430-464.
8. Jelenković, P. R. and Radovanović, A. Least-recently-used caching with dependent requests. Technical Report EE2002-12-201, Department of Electrical Engineering, Columbia University, New York, August 2002; Theoretical Computer Science, to appear.
9. Jelenković, P. R. and Radovanović, A. Least-recently-used caching with dependent requests. Technical Report EE2002-12-201, Department of Electrical Engineering, Columbia University, New York, August 2002; Theoretical Computer Science, to appear.
10. Jelenković, P. R. and Radovanović, A. (2003) Asymptotic insensitivity of least-recently-used caching to statistical dependency. In Proc. INFOCOM 2003, San Francisco, April 2003.
11. Moret, B. and Shapiro, H. (1991) Algorithms from P to NP: Volume 1 Design and Efficiency, The Benjamin/Cummings Publishing Company, Redwood City, CA.
12. Starobinski, D. and Tse, D. (2001) Probabilistic methods for Web caching. Performance Evaluation 46 125-137.
13. Young, N. (2002) On-line file caching. Algorithmica 33 371-383.