# A unified approach to the performance analysis of caching systems

arXiv: https://arxiv.org/abs/1307.6702 · HTML: https://mlsanity.com/paper/1307.6702/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jul 2013.

## Built on by (most cited first, 3 of 3)

- [No-Regret Caching via Online Mirror Descent](https://mlsanity.com/paper/2101.12588/) (2021)
- [Accelerating Deep Learning Classification with Error-controlled Approximate-key Caching](https://mlsanity.com/paper/2112.06671/) (2021)
- [Beyond 5G Networks: Integration of Communication, Computing, Caching, and Control](https://mlsanity.com/paper/2212.13141/) (2022)

## Abstract (arXiv)

We propose a unified methodology to analyse the performance of caches (both isolated and interconnected), by extending and generalizing a decoupling technique originally known as Che's approximation, which provides very accurate results at low computational cost. We consider several caching policies, taking into account the effects of temporal locality. In the case of interconnected caches, our approach allows us to do better than the Poisson approximation commonly adopted in prior work. Our results, validated against simulations and trace-driven experiments, provide interesting insights into the performance of caching systems.