Optimistic Online Caching for Batched Requests - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Optimistic Online Caching for Batched Requests

Abstract

In this paper we study online caching problems where predictions of future requests, e.g., provided by a machine learning model, are available. We consider different optimistic caching policies which are based on the Follow-The-Regularized-Leader algorithm and enjoy strong theoretical guarantees in terms of regret. These new policies have a higher computational cost than classic ones like LRU, LFU, as each update of the cache state requires to solve a constrained optimization problem. We study then their performance when the cache is updated less frequently in order to amortize the update cost over time or over multiple requests.
Fichier principal
Vignette du fichier
Optimistic_Batch_Caching.pdf (710.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04367129 , version 1 (29-12-2023)

Licence

Attribution

Identifiers

Cite

Francescomaria Faticanti, Giovanni Neglia. Optimistic Online Caching for Batched Requests. ICC 2023 - IEEE International Conference on Communications, May 2023, Rome, France. pp.6243-6248, ⟨10.1109/ICC45041.2023.10278692⟩. ⟨hal-04367129⟩
16 View
11 Download

Altmetric

Share

Gmail Facebook X LinkedIn More