Published December 14, 2021
| Version v1
Journal article
Online Caching Networks with Adversarial Guarantees
- Others:
- Northeastern University [Boston]
- Université Côte d'Azur (UCA)
- Network Engineering and Operations (NEO ) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Description
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.
Abstract
International audience
Additional details
- URL
- https://hal-ineris.archives-ouvertes.fr/ineris-03484121
- URN
- urn:oai:HAL:ineris-03484121v1
- Origin repository
- UNICA