Comparing strength of locality of reference - Popularity, majorization, and some folk theorems

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2004, Pages 838-849

  Vanichpun, Sarut ^a   Makowski, Armand M ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Locality of reference in request streams; Majorization schur concavity; Popularity

Indexed keywords

FILE SHARING SYSTEMS; LOCALITY OF REFERENCE IN REQUEST STREAMS;

ALGORITHMS; DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; FILE ORGANIZATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

CACHE MEMORY;

EID: 8344237454     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2004.1356972     Document Type: Conference Paper

References (27)

1. O.I. Aven, E.G. Coffman and Y.A. Kogan, Stochastic Analysis of Computer Storage. D. Reidel Publishing Company, Dordrecht (Holland),1987.
2. E. Coffman and P. Denning, Operating Systems Theory, Prentice-Hall, NJ, 1973.
3. V. Phalke and B. Gopinath, "An interference gap model for temporal locality in program behavior," in Proceedings of ACM SIGMET-RIGS'1995. May 1995, pp. 291-300.
4. L.A. Belady, "A study of replacement algorithms for a virtual-storage computer,'' IBM Systems Journal 5 (1966), pp. 78-101.
5. S. Jin and A. Bestavros, "Sources and characteristics of Web temporal locality," in Proceedings of MASCOTS'2000, San Francisco (CA), August 2000.
6. S. Jin and A. Bestavros, "Temporal locality in Web request streams: Sources, characteristics, and caching implications" (Extended Abstract), in Proceedings of ACM SIGMETRICS'2000, Santa Clara (CA), June 2000.
7. A. Mahanti, C. Williamson and D. Eager, "Temporal locality and its impact on Web proxy cache performance," Performance Evaluation 42 (2000), Special Issue on Internet Performance Modelling, pp. 187-203.
8. P.J. Denning, "The working set model for program behavior," Communications of the ACM 11 (1968), pp. 323-333.
9. P.J. Denning and S.S. Schwartz, "Properties of the working set model," Communications of the ACM 15 (1972), pp. 191-198.
10. R. Fonseca, V. Almeida, M. Crovella and B. Abrahao, "On the intrinsic locality of Web reference streams," in Proceedings of IEEE INFOCOM 2003, San Francisco (CA), April 2003.
11. V. Almeida, A. Bestavros, M. Crovella and A. de Oliveira, "Characterizing reference locality in the Web." in Proceedings of PDIS'96, December 1996, Miami (FL), pp. 92-107.
12. A. Balamash and M. Krunz, "Application of multifractals in the characterization of WWW traffic," in Proceedings of ICC 2002, April 2002.
13. R.L. Mattson, J. Gecsei, D.R. Slutz and L. Traiger, "Evaluation techniques for storage hierarchies," IBM Systems Journal 9 (1970), pp. 78-117.
14. L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker, "Web caching and Zipf-like distributions: Evidence and implications," in Proceedings of IEEE INFOCOM 1999, New York (NY). March 1999.
15. P. Jelenkovic and A. Radovanovic, "Asymptotic insensitivity of Least-Recently-Used caching to statistical dependency," in Proceedings of IEEE INFOCOM 2003, San Francisco (CA), April 2003.
16. A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, New York (NY), 1979.
17. S. Vanichpun and A.M. Makowski, "The output of a cache under the Independent Reference Model - Where did the locality of reference go?," submitted for inclusion in the program of Performance 2004, New York (NY), June 2004.
18. A.M. Makowski and S. Vanichpun, "Comparing strength of locality of reference - Popularity, majorization, and some folk theorems for miss rates and the output of cache," in Performance Evaluation and Planning Methods for the Next Generation Internet. A. Girard, B. Sansó and F. J. Vázquez-Abad, Editors, Kluwer Academic Press.
19. S. Christodoulakis, "Implications of certain assumptions in database performance evaluation," ACM Transactions on Database Systems 9 (1984), pp. 163-186.
20. P.C. Yue and C.K. Wong, "On the optimality of the probability ranking scheme in storage applications," Journal of the ACM 20 (1973), pp. 624-633.
21. S. Jin and A. Bestavros, "GreedyDual* Web caching algorithm: Exploiting the two sources of temporal locality in Web request streams," in Proceedings of the 5th International Web Caching and Content Delivery Workshop. Lisbon, Portugal. May 2000.
22. S. Gadde, J.S. Chase and M. Rabinovich, "Web caching and content distribution: A view from the interior," Computer Communications 24 (2001), pp. 222-231.
23. E. Gelenbe, "A unified approach to the evaluation of a class of replacement algorithms," IEEE Transactions on Computers 22 (1973). pp. 611-618.
24. M. Shaked and J.G. Shanthikumar, Stochastic Orders and Their Applications, Academic Press, San Diego (CA), 1994.
25. C.K. Wong and P.C. Yue, "A majorization theorem for the number of distinct outcomes in N independent trials." Discrete Mathematics 6 (1973), pp. 391-398.
26. P. Flajolet, D. Gardy and L. Thimonier, "Birthday paradox, coupon collector, caching algorithms and self-organizing search," Discrete Applied Mathematics 39 (1992), pp. 207-229.
27. P.R. Jelenkovic, "Asymptotic approximation of the Move-To-Front search cost distribution and Least-Recently-Used caching fault probabilities," Annals of Applied Probability 9 (1999), pp. 420-469.