Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata
Contributor : Tareq Si Salem Connect in order to contact the contributor
Submitted on : Thursday, December 16, 2021 - 7:03:58 PM
Last modification on : Sunday, December 19, 2021 - 3:10:23 AM


Files produced by the author(s)



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 , ACM, 2021, 5, pp.1 - 39. ⟨10.1145/3491047⟩. ⟨ineris-03484121⟩



Les métriques sont temporairement indisponibles