Cache Miss Estimation for Non-Stationary Request Processes

References

• Ahlgren B, Dannewitz C, Imbrenda C, Kutscher D, Ohlman B (2012) A survey of information-centric networking. Comm. Magazine, IEEE 50(7):26–36.Google Scholar
• Baccelli F, Brémaud P (2013) Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, Vol. 26 (Springer, Berlin).Google Scholar
• Che H, Tung Y, Wang Z (2002) Hierarchical web caching systems: Modeling, design and experimental results. Selected Areas Comm., IEEE J. 20(7):1305–1314.Google Scholar
• Cisco Systems, Inc. (2015) Cisco Visual Networking Index: Forecast and Methodology, 2014–2019. White Paper, Cisco.Google Scholar
• Daley DJ, Vere-Jones D (2003) An Introduction to the Theory of Point Processes, 2nd ed., Vol. 1 (Springer, New York).Google Scholar
• Daley DJ, Vere-Jones D (2008) An Introduction to the Theory of Point Processes, 2nd ed., Vol. 2 (Springer, New York).Google Scholar
• Dembo A, Zeitouni O (2009) Large Deviations Techniques and Applications, Vol. 38 (Springer, Berlin).Google Scholar
• dos Santos Gromicho JA (2013) Quasiconvex Optimization and Location Theory, Vol. 9 (Springer, Berlin).Google Scholar
• Fill JA, Holst L (1996) On the distribution of search cost for the move-to-front rule. Random Structures and Algorithms 8(3):179–186.Google Scholar
• Fofack NC, Nain P, Neglia G, Towsley D (2012) Analysis of TTL-based cache networks. Gaujal B, Jean-Marie A, Jorswieck E, Seuret A, eds. Proc. 6th Internat. ICST Conf. Performance Evaluation Methodologies and Tools (VALUETOOLS) (IEEE, Piscataway, NJ), 1–10.Google Scholar
• Fofack NC, Towsley D, Badov M, Dehghan M, Goeckel DL (2014) An approximate analysis of heterogeneous and general cache networks. Technical report, Inria.Google Scholar
• Folland GB (1999) Real Analysis: Modern Techniques and Their Applications, 2nd ed. (John Wiley & Sons, New York).Google Scholar
• Fricker C, Robert P, Roberts J (2012) A versatile and accurate approximation for LRU cache performance. Proc. 24th Internat. Teletraffic Congress (ITC) (IEEE, Piscataway, NJ), 1–8.Google Scholar
• Gut A (2006) Probability: A Graduate Course (Springer, New York).Google Scholar
• Kallenberg O (2006) Foundations of Modern Probability (Springer, New York).Google Scholar
• Leonardi E, Torrisi GL (2015) Least recently used caches under the shot noise model. Proc. IEEE Conf. Comput. Comm. (INFOCOM) (IEEE, Piscataway, NJ), 2281–2289.Google Scholar
• Mathematical Association of America (2011) Problems and solutions. Amer. Math. Monthly 118(3):275–282.Google Scholar
• Miller PD (2006) Applied Asymptotic Analysis, Vol. 75 (AMS, Providence, RI).Google Scholar
• Olmos F, Kauffmann B, Simonian A, Carlinet Y (2014) Catalog dynamics: Impact of content publishing and perishing on the performance of a LRU cache. Proc. 26th Internat. Teletraffic Congress (ITC) (IEEE, Piscataway, NJ), 1–9.Google Scholar
• Traverso S, Ahmed M, Garetto M, Giaccone P, Leonardi E, Niccolini S (2013) Temporal locality in today’s content caching: Why it matters and how to model it. ACM SIGCOMM Comput. Comm. Rev. 43(5):5–12.Google Scholar
• Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues (Springer, New York).Google Scholar
• Williams D (1991) Probability with Martingales (Cambridge University Press, Cambridge, UK).Google Scholar