A Swiss Army Knife for Online Caching in Small Cell Networks
- 9 August 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 29 (6) , 2536-2547
Abstract
We consider a dense cellular network, in which a limited-size cache is available at every base station (BS). Coordinating content allocation across the different caches can lead to significant performance gains, but is a difficult problem even when full information about the network and the request process is available. In this paper we present $q$ LRU- $\Delta $ , a general-purpose online caching policy that can be tailored to optimize different performance metrics also in presence of coordinated multipoint transmission techniques. The policy requires neither direct communication among BSs, nor a priori knowledge of content popularity and, under stationary request processes, has provable performance guarantees.Keywords
All Related Versions
Funding Information
- French Government through the EUR DS4H Investments in the Future project managed by the National Research Agency (ANR-17-EURE-0004)
- “5C-for-5G” JCJC project (ANR-17-CE25-0001)
This publication has 32 references indexed in Scilit:
- On the Interaction between Content Caching and Request Assignment in Cellular Cache Networks2015
- Distributed Caching and Small Cell Cooperation for Fast Content Delivery2015
- Approximation Algorithms for Mobile Data Caching in Small Cell NetworksIEEE Transactions on Communications, 2014
- Hierarchical Web caching systems: modeling, design and experimental resultsIEEE Journal on Selected Areas in Communications, 2002
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilitiesThe Annals of Applied Probability, 1999
- Quasi-Statically Cooled Markov ChainsProbability in the Engineering and Informational Sciences, 1994
- Simulated Annealing Type Markov Chains and Their Order Balance EquationsSIAM Journal on Control and Optimization, 1989
- A proof of the Markov chain tree theoremStatistics & Probability Letters, 1989
- Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated AnnealingProbability in the Engineering and Informational Sciences, 1988
- Asymptotic miss ratios over independent referencesJournal of Computer and System Sciences, 1977