Asymptotic insensitivity of least-recently-used caching to statistical dependency

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 438-447

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

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA TRANSFER; MARKOV PROCESSES; SERVERS; STATISTICAL METHODS; WORLD WIDE WEB; ASYMPTOTIC ANALYSIS; COMPUTATIONAL LINGUISTICS;

ASYMPTOTIC INSENSITIVITY;

BUFFER STORAGE; PROXY CACHES;

AVERAGE-CASE ANALYSIS; CACHE REPLACEMENT ALGORITHM; CACHE SIZE; CACHING PERFORMANCE; FAULT PROBABILITIES; LONG RANGE DEPENDENCE; PROXY SERVER; SEMI MARKOV PROCESS; SEMI-MARKOV; SIMULATION EXPERIMENTS; STATISTICAL CORRELATION; STATISTICAL DEPENDENCIES; STATISTICALLY DEPENDENT; WEB CACHE; ZIPF'S LAW;

EID: 0041974535     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, 1973.
2. J. L. Bentley and C. C. McGeoch, "Amortized analysis of self-organizing sequential search heuristics," Communications of the ACM, vol. 28, no. 4, pp. 404-411, 1985.
3. D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules," Communications of the ACM, vol. 28, no. 2, pp. 202-208, 1985.
4. W. A. Borodin, S. Irani, P. Raghavan, and B. Schieber, "Competitive paging with locality of reference," Journal of Computer and System Science, vol. 50, no. 2, pp. 244-258, 1995.
5. S. Irani, A. R. Karlin, and S. Philips, "Strongly competitive algorithms for paging with locality of reference," SIAM J. Comput., vol. 25, no. 3, pp. 477-497, June 1996.
6. P. R. Jelenković, "Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities," Annals of Applied Probability, vol. 9, no. 2, pp. 430-464, 1999.
7. P. Flajolet, D. Gardy, and L. Thimonier, "Birthday paradox, coupon collector, caching algorithms and self-organizing search," Discrete Applied Mathematics, vol. 39, pp. 207-229, 1992.
8. J. A. Fill, "An exact formula for the move-to-front rule for self-organizing lists," Journal of Theoretical Probability, vol. 9, no. 1, pp. 113-159, 1996.
9. P. R. Jelenković and A. Radovanović, "Least-Recently-Used Caching with Dependent Requests," Tech. Rep. EE2002-12-201, Department of Electrical Engineering, Columbia University, New York, August 2002.
10. E. Cinlar, Introduction to Stochastic Processes, Prentice-Hall, 1975.
11. J. A. Fill and L. Holst, "On the distribution of search cost for the move-to-front rule," Random structures and algorithms, vol. 8, no. 3, pp. 179, 1996.
12. F. Baccelli and P. Bremaud, Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurence, Springer Verlag, 1994.
13. P. R. Jelenković and A. A. Lazar, "Subexponential asymptotics of a Markov-modulated random walk with queueing applications," Journal of Applied Probability, vol. 35, no. 2, pp. 325-347, June 1998.
14. V. Almeida, A. Bestavros, M. Crovella, and A. de Oliviera, "Characterizing reference locality in the WWW," in Proceedings of the Fourth International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, December 1996.
15. L. Breslau, Pei Cao, Li Fan, G. Phillips, and S. Shenker, "Web caching and Zipf-like distributions: Evidence and implications," in IEEE INFOCOM, 1999.