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 qLRU-Δ, 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.
A Swiss Army Knife for Online Caching in Small Cell Networks / Neglia, Giovanni; Leonardi, Emilio; Ricardo, Guilherme Iecker; Spyropoulos, Thrasyvoulos. - In: IEEE-ACM TRANSACTIONS ON NETWORKING. - ISSN 1063-6692. - ELETTRONICO. - 29:6(2021), pp. 2536-2547. [10.1109/TNET.2021.3100757]
Titolo: | A Swiss Army Knife for Online Caching in Small Cell Networks | |
Autori: | ||
Data di pubblicazione: | 2021 | |
Rivista: | ||
Digital Object Identifier (DOI): | http://dx.doi.org/10.1109/TNET.2021.3100757 | |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
arxiv.pdf | Post-print | 2. Post-print / Author's Accepted Manuscript | PUBBLICO - Tutti i diritti riservati | Visibile a tuttiVisualizza/Apri |
Leonardi-ASwiss.pdf | 2a Post-print versione editoriale / Version of Record | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2938872