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.
Cite
@article{arxiv.1411.4759,
title = {Modeling LRU caches with Shot Noise request processes},
author = {Emilio Leonardi and Giovanni Luca Torrisi},
journal= {arXiv preprint arXiv:1411.4759},
year = {2016}
}
Comments
To appear in SIAP - A preliminary, incomplete version of this work has appeared in Proceedings of IEEE Infocom 2015, HK