Online Caching Networks with Adversarial Guarantees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Proceedings of the ACM on Measurement and Analysis of Computing Systems Year : 2021

Online Caching Networks with Adversarial Guarantees

Abstract

We study a cache network under arbitrary adversarial request arrivals. We propose a distributed online policy based on the online tabular greedy algorithm. Our distributed policy achieves sublinear (1-1/e)-regret, also in the case when update costs cannot be neglected. Numerical evaluation over several topologies supports our theoretical results and demonstrates that our algorithm outperforms state-of-art online cache algorithms.
Fichier principal
Vignette du fichier
sigmetrics.pdf (6.28 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ineris-03484121 , version 1 (16-12-2021)

Identifiers

Cite

Yuanyuan Li, Tareq Si Salem, Giovanni Neglia, Stratis Ioannidis. Online Caching Networks with Adversarial Guarantees. Proceedings of the ACM on Measurement and Analysis of Computing Systems , 2021, 5, pp.1 - 39. ⟨10.1145/3491047⟩. ⟨ineris-03484121⟩
33 View
107 Download

Altmetric

Share

Gmail Facebook X LinkedIn More