In this paper we analyze Least Recently Used (LRU) caches operating under the Shot Noise requests Model (SNM). The SNM was recently proposed in  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 law of large numbers, a large deviation principle 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.
|Titolo:||Modeling LEAST RECENTLY USED caches with Shot Noise request processes|
|Data di pubblicazione:||2017|
|Digital Object Identifier (DOI):||10.1137/15M1041444|
|Appare nelle tipologie:||1.1 Articolo in rivista|