Least Recently Used caches under the ShotNoise Model

Speaker : Emilio Leonardi
Politecnico di Torino
Date: 09/09/2015
Time: 2:00 pm - 3:00 pm
Location: LINCS Meeting Room 40


Talk: Least Recently Used caches under the ShotNoise Model
Abstract: In this paper we develop an analytical framework, based on the Che approximationfor the analysis of 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.In this context, the Che approximation is derived as the application of a mean field principle to the cache eviction time. We investigate the validity of this approximation through an asymptotic analysisof the cache eviction time. Particularly, we provide a large deviation principle and a central limit theorem for the cache eviction time, as the cache size grows large. Furthermore, we obtain a non-asymptotic analytical upper bound on the error entailed by Che’s approximation of the hit probability. This work appeared at IEEE INFOCOM’15