On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution

Random Structures and Algorithms

Volumn 29, Issue 3, 2006, Pages 296-323

  Sugimoto, Toyoaki ^a   Miyoshi, Naoto ^a  

^a Tokyo Institute of Technology ^*  (Japan)

Author keywords

Distributional tail asymptotics; Least recently used caching; Move to front algorithm; Negative association; Zipf type distribution

Indexed keywords

EID: 33749361701     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20098     Document Type: Article

References (26)

1. 19937 - 1. http://www.math.sci.hiroshima-u.ac.jp/~m-raat/MT/emt.html.
2. F. Baccelli and P. Bŕmaud, Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences, 2nd ed., Springer-Verlag, Berlin, 2003.
3. A. Brandt, P. Franken, and B. Lisek, Stationary Stochastic Models, Wiley, 1990.
4. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, Web caching and Zipf-like distributions: Evidence and implications, In Proc IEEE INFOCOM '99, New York, March 1999. pp. 126-134.
5. P. J. Burville and J. F. C. Kingman, On a model for storage and search, J Appl Probab 10 (1973), 697-701.
6. J.-H. Chu and G. D. Knott, A new method for computing page-fault rates, SIAM J Comput 22(1993), 1319-1330.
7. E. G. Coffman Jr. and P. J. Denning, Operating Systems Theory, Prentice-Hall, Englewood Cliffs, NJ, 1973.
8. E. G. Coffman Jr. and P. R. Jelenković, Performance of the move-to-front algorithm with Markov-modulated request sequences, Oper Res Lett 25 (1999), 109-118.
9. P. J. Davis, Gamma function and related functions. In M. Abramowitz and C. A. Stegun (editors), Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing, Chap. 6, pp. 253-293. Dover, New York, 1972.
10. R. P. Dobrow and J. A. Fill, The move-to-front rule for self-organizing lists with Markovian dependent requests. In D. Aldous, P. Diaconis, J. Spencer, and J. M. Steele (editors), Discrete Probability and Algorithms, pp. 57-80. Springer-Verlag, Berlin, 1995.
11. D. Dubhashi and D. Ranjan, Balls and bins: A study in negative dependence, Random Struct Algor 13 (1998), 99-124.
12. J. A. Fill, Limits and rate of convergence for the distribution of search cost under the move-to-front rule, Theoret Comput Sci 164 (1996), 185-206.
13. J. A. Fill and L. Holst, On the distribution of search cost for the move-to-front rule, Random Struct Algor 8 (1996), 179-186.
14. P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Appl Math 39 (1992), 207-229.
15. W. J. Hendricks, The stationary distribution of an interesting Markov chain, J Appl Probab 9 (1972), 231-233.
16. P. R. Jelenković, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, Ann Appl Probab 9 (1999), 430-464.
17. P. R. Jelenković and A. Radovanović, Least-recently-used caching with dependent requests, Theoret Comput Sci 326 (2004), 293-327.
18. K. Joag-Dev and F. Proschan, Negative association of random variables, with applications, Ann Statist 11 (1983), 286-295.
19. D. E. Knuth, The Art of Computer Programming 3: Sorting and Searching, Addison-Wesley, 1973.
20. K. Lam, M.-Y. Leung, and M.-K. Siu, Self-organizing files with dependent access, J Appl Probab 21 (1984), 343-359.
21. J. McCabe, On serial files with relocatable records, Oper Res 13 (1965), 609-618.
22. A. Müller and D. Stoyan, Comparison Methods for Stochastic Models and Risks, Wiley, 2002.
23. V. N. Padmanabhan and L. Qiu, The content and access dynamics of a busy web site: Findings and implications, In Proc ACM SIGCOMM 2000, pp. 111-123, Stockholm, Sweden, 2000.
24. E. R. Rodrigues, The performance of the move-to-front scheme under some particular form of Markovian requests, J Appl Probab 32 (1995), 1089-1102.
25. R. H. Schonmann, Exponential convergence under mixing, Probab Theory Relat Fields 81 (1989), 235-238.
26. A. Tanaka and I. Kino, Lumpability in LRU stack with Markovian page references, J Oper Res Soc Japan 41 (1998), 91-117.