Analysis of TTL-based cache networks
暂无分享,去创建一个
Donald F. Towsley | Giovanni Neglia | Philippe Nain | Nicaise Choungmo Fofack | D. Towsley | P. Nain | G. Neglia | N. C. Fofack
[1] W. Frank King,et al. Analysis of Demand Paging Algorithms , 1971, IFIP Congress.
[2] Hari Balakrishnan,et al. Modeling TTL-based Internet caches , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[3] Predrag R. Jelenkovic,et al. Performance of the move-to-front algorithm with Markov-modulated request sequences , 1999, Oper. Res. Lett..
[4] Krishna P. Gummadi,et al. An analysis of Internet content delivery systems , 2002, OPSR.
[5] James Allen Fill,et al. Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule , 1996, Theor. Comput. Sci..
[6] Nikolaos Laoutaris,et al. Meta algorithms for hierarchical Web caches , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.
[7] H. Robbins,et al. Asymptotically efficient adaptive allocation rules , 1985 .
[8] Asit Dan,et al. An approximate analysis of the LRU and FIFO buffer replacement schemes , 1990, SIGMETRICS '90.
[9] P. Jelenkovic. Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .
[10] W. J. Hendricks. The stationary distribution of an interesting Markov chain , 1972, Journal of Applied Probability.
[11] H. Apte,et al. An Analysis of Internet Content Delivery Systems , 2006 .
[12] Massimo Gallo,et al. Modeling data transfer in content-centric networking , 2011, 2011 23rd International Teletraffic Congress (ITC).
[13] Hao Che,et al. Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..
[14] Donald F. Towsley,et al. Approximate Models for General Cache Networks , 2010, 2010 Proceedings IEEE INFOCOM.
[15] P. Jelenkovic,et al. Critical sizing of LRU caches with dependent requests , 2006, Journal of Applied Probability.
[16] Robert Tappan Morris,et al. DNS performance and the effectiveness of caching , 2002, TNET.
[17] Predrag R. Jelenkovic,et al. Least-recently-used caching with dependent requests , 2004, Theor. Comput. Sci..
[18] Philippe Flajolet,et al. Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..
[19] Chadi Barakat,et al. Network-wide monitoring through self-configuring adaptive system , 2011, 2011 Proceedings IEEE INFOCOM.
[20] Van Jacobson,et al. Networking named content , 2009, CoNEXT '09.
[21] Arjen K. Lenstra. Birthday Paradox , 2011, Encyclopedia of Cryptography and Security.
[22] James R. Bitner,et al. Heuristics That Dynamically Organize Data Structures , 1979, SIAM J. Comput..
[23] P. J. Burville,et al. On a model for storage and search , 1973, Journal of Applied Probability.
[24] James Allen Fill,et al. THE MOVE-TO-FRONT RULE FOR SELF-ORGANIZING LISTS WITH MARKOV DEPENDENT REQUESTS· , 1995 .
[25] A. J. Lawrance,et al. Dependency of Intervals between Events in Superposition Processes , 1973 .