Modeling LRU caches with Shot Noise request processes
Preprint
Abstract
In this paper we analyze Least Recently Used (LRU) caches operating under the Shot Noise requests Model (SNM). The SNM was recently proposed to better capture the main characteristics of today Video on Demand (VoD) traffic. We investigate the validity of Che's approximation through an asymptotic analysis of the cache eviction time. In particular, we provide a large deviation principle, a law of large numbers and a central limit theorem for the cache eviction time, as the cache size grows large. Finally, we derive upper and lower bounds for the "hit" probability in tandem networks of caches under Che's approximation.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Least recently used caches under the Shot Noise Model2015
- Performance evaluation of hierarchical TTL-based cache networksComputer Networks, 2014
- A unified approach to the performance analysis of caching systems2014
- Normal Approximations with Malliavin Calculus2012
- Large deviations of Poisson shot noise processes under heavy tail semi-exponential conditionsStatistics & Probability Letters, 2010
- Robust dynamic classes revealed by measuring the response function of a social systemProceedings of the National Academy of Sciences, 2008
- A class of risk processes with reserve-dependent premium rate: sample path large deviations and importance samplingQueueing Systems, 2007
- Simulating the ruin probability of risk processes with delay in claim settlementStochastic Processes and their Applications, 2004
- Hierarchical Web caching systems: modeling, design and experimental resultsIEEE Journal on Selected Areas in Communications, 2002
- Power-law shot noiseIEEE Transactions on Information Theory, 1990