Optimal Local Storage Policy Based on Stochastic Intensities and Its Large-Scale Behavior

References

• Baccelli F, Brémaud P (2013) Elements of Queueing Theory (Springer-Verlag, Berlin).Google Scholar
• Bahat O, Makowski AM (2005) Measuring consistency in TTL-based caches. Performance Evaluation 62(1):439–455.Google Scholar
• Barrera J, Fontbona J (2010) The limiting move-to-front search-cost in law of large numbers asymptotic regimes. Ann. Appl. Probab. 20(2):722–752.Google Scholar
• Berger DS, Gland P, Singla S, Ciucu F (2014) Exact analysis of TTL cache networks. Performance Evaluation 79:2–23.Google Scholar
• Berger DS, Henningsen S, Ciucu F, Schmitt JB (2015) Maximizing cache hit ratios by variance reduction. ACM SIGMETRICS Performance Evaluation Rev. 43(2):57–59.Google Scholar
• Bianchi G, Detti A, Caponi A, Blefari Melazzi N (2013) Check before storing: What is the performance price of content integrity verification in LRU caching? ACM SIGCOMM Comput. Comm. Rev. 43(3):59–67.Google Scholar
• Bilal M, Kang SG (2017) A cache management scheme for efficient content eviction and replication in cache networks. IEEE Access 5:1692–1701.Google Scholar
• Billingsley P (1999) Convergence of Probability Measures, Wiley Series in Probability and Statistics, 2nd ed. (Wiley, Chichester, UK).Google Scholar
• Borst S, Gupta V, Walid A (2010) Distributed caching algorithms for content distribution networks. 2010 Proc. IEEE INFOCOM (IEEE, Piscataway, NJ), 1–9.Google Scholar
• Brémaud P (2020) Point Process Calculus in Time and Space (Springer, New York).Google Scholar
• Che H, Tung Y, Wang Z (2002) Hierarchical web caching systems: Modeling, design and experimental results. IEEE J. Selected Areas Comm. 20(7):1305–1314.Google Scholar
• Colosimo E, Ferreira F, Oliveira M, Sousa C (2002) Empirical comparisons between Kaplan–Meier and Nelson–Aalen survival function estimators. J. Statist. Comput. Simulation 72(4):299–308.Google Scholar
• Daley DJ, Vere-Jones D (2003) An Introduction to the Theory of Point Processes: Volume I: Elementary Theory and Methods (Springer, New York).Google Scholar
• Dan A, Towsley D (1990) An approximate analysis of the LRU and FIFO buffer replacement schemes. Proc. ACM/SIGMETRICS 1990 (ACM, New York), 143–152.Google Scholar
• Dehghan M, Massoulie L, Towsley D, Menasche DS, Tay YC (2019) A utility optimization approach to network cache design. IEEE/ACM Trans. Networking 27(3):1013–1027.Google Scholar
• Ferragut A, Carrasco M, Paganini F (2024) Caching or pre-fetching? The role of hazard rates. 2024 60th Annual Allerton Conf. Comm. Control Comput. (IEEE, Piscataway, NJ), 1–8.Google Scholar
• Ferragut A, Rodriguez I, Paganini F (2016) Optimizing TTL caches under heavy tailed demands. Proc. ACM/SIGMETRICS 2016 (ACM, New York), 101–112.Google Scholar
• Ferragut A, Rodríguez I, Paganini F (2018) Optimal timer-based caching policies for general arrival processes. Queueing Systems 88(3–4):207–241.Google Scholar
• Fill JA (1996) Limits and rates of convergence for the distribution of search cost under the move-to-front rule. Theoret. Comput. Sci. 164(1):185–206.Google Scholar
• Fofack NC, Nain P, Neglia G, Towsley D (2012) Analysis of TTL-based cache networks. Proc. Internat. Conf. Performance Evaluation Methodologies Tools (VALUETOOLS) (IEEE, Piscataway, NJ), 1–10.Google Scholar
• Fofack NC, Nain P, Neglia G, Towsley D (2014) Performance evaluation of hierarchical TTL-based cache networks. Comput. Networks 65:212–231.Google Scholar
• Fricker C, Robert P, Roberts J (2012) A versatile and accurate approximation for LRU cache performance. Proc. 24th Internat. Teletraffic Congress (IEEE, Piscataway, NJ), 57–64.Google Scholar
• Garetto M, Leonardi E, Martina V (2016) A unified approach to the performance analysis of caching systems. ACM Trans. Model. Performance Evaluation Comput. Systems 1(3):1–28.Google Scholar
• Gast N, Houdt BV (2015) Transient and steady-state regime of a family of list-based cache replacement algorithms. Proc. ACM/SIGMETRICS 2015 (ACM, New York), 123–136.Google Scholar
• Gelenbe E (1973) A unified approach to the evaluation of a class of replacement algorithms. IEEE Trans. Comput. C-22(6):611–618.Google Scholar
• Ioannidis S, Yeh E (2016) Adaptive caching networks with optimality guarantees. ACM SIGMETRICS Performance Evaluation Rev. 44(1):113–124.Google Scholar
• Ioannidis S, Massoulie L, Chaintreau A (2010) Distributed caching over heterogeneous mobile networks. Proc. ACM SIGMETRICS Internat. Conf. Measurement Model. Comput. Systems (ACM, New York), 311–322.Google Scholar
• Jelenković PR (1999) Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities. Ann. Appl. Probab. 9(2):430–464.Google Scholar
• Jelenković P, Radovanović A (2003) Asymptotic insensitivity of least-recently-used caching to statistical dependency. Proc. IEEE/INFOCOM 2003 (IEEE, Piscataway, NJ), 438–447.Google Scholar
• Jelenković PR, Radovanović A (2004) Least-recently-used caching with dependent requests. Theoret. Comput. Sci. 326(1):293–327.Google Scholar
• Jelenković PR, Radovanović A (2008) The persistent-access-caching algorithm. Random Structures Algorithms 33(2):219–251.Google Scholar
• Jelenković PR, Radovanović A, Squillante MS (2006) Critical sizing of LRU caches with dependent requests. J. Appl. Probab. 43(4):1013–1027.Google Scholar
• Jung J, Berger AW, Balakrishnan H (2003) Modeling TTL-based internet caches. Proc. IEEE/INFOCOM 2003 (IEEE, Piscataway, NJ), 417–426.Google Scholar
• King W (1971) Analysis of paging algorithms. Proc. IFIP Congress 1971 (North-Holland Publishing Company, Amsterdam), 485–490.Google Scholar
• Martina V, Garetto M, Leonardi E (2014) A unified approach to the performance analysis of caching systems. Proc. IEEE/INFOCOM 2014 (IEEE, Piscataway, NJ), 2040–2048.Google Scholar
• Panigrahy NK, Li J, Towsley D (2017) Hit rate vs. hit probability based cache utility maximization. ACM SIGMETRICS Performance Evaluation Rev. 45(2):21–23.Google Scholar
• Panigrahy NK, Li J, Towsley D, Hollot CV (2020) Network cache design under stationary requests: Exact analysis and Poisson approximation. Comput. Networks 180:107379.Google Scholar
• Panigrahy NK, Nain P, Neglia G, Towsley D (2022) A new upper bound on cache hit probability for non-anticipative caching policies. ACM Trans. Model. Performance Evaluation Comput. Systems 7(2–4):5.Google Scholar
• Rosensweig EJ, Kurose J, Towsley D (2010) Approximate models for general cache networks. Proc. IEEE/INFOCOM 2010 (IEEE, Piscataway, NJ), 1–9.Google Scholar
• Shorack GR (1979) The weighted empirical process of row independent random variables with arbitrary distribution functions. Statistica Neerlandica 33(4):169–189.Google Scholar
• Tanner MA, Wong WH (1983) The estimation of the hazard function from randomly censored data by the kernel method. Ann. Statist. 11(3):989–993.Google Scholar
• van der Vaart AW (1998) Asymptotic Statistics, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 3 (Cambridge University Press, Cambridge, UK).Google Scholar