Online Convex Optimization for Caching Networks

01/16/2020
by   Georgios Paschos, et al.
0

We study the problem of wireless edge caching when file popularity is unknown and possibly non-stationary. A bank of J caches receives file requests and a utility is accrued for each request depending on the serving cache. The network decides dynamically which files to store at each cache and how to route them, in order to maximize total utility. The request sequence is assumed to be drawn from an arbitrary distribution, thus capturing time-variance, temporal, or spatial locality of requests. For this challenging setting, we propose the Bipartite Supergradient Caching Algorithm (BSCA) which provably exhibits no regret (R_T/T → 0). That is, as the time horizon T increases, BSCA achieves the same performance with the cache configuration that we would have chosen knowing all future requests. The learning rate of the algorithm is characterized by its regret expression, found to be R_T=O(√(JT)), which is independent of the content catalog size. For the single-cache case, we prove that this is the lowest attainable bound. BSCA requires at each step J projections on intersections of boxes and simplices, for which we propose a tailored algorithm. Our model is the first that draws a connection between the network caching problem and Online Convex Optimization, and we demonstrate its generality by discussing various practical extensions and presenting a trace-driven comparison with state-of-the-art competitors.

READ FULL TEXT

page 4

page 6

page 7

page 8

page 9

page 10

page 11

page 14

research
01/18/2021

Online Caching with Optimal Switching Regret

We consider the classical uncoded caching problem from an online learnin...
research
01/29/2021

No-Regret Caching via Online Mirror Descent

We study an online caching problem in which requests can be served by a ...
research
04/22/2019

Learning to Cache With No Regrets

This paper introduces a novel caching analysis that, contrary to prior w...
research
04/01/2020

Learning to Cache and Caching to Learn: Regret Analysis of Caching Algorithms

Crucial performance metrics of a caching algorithm include its ability t...
research
07/10/2018

Soft-TTL: Time-Varying Fractional Caching

Standard Time-to-Live (TTL) cache management prescribes the storage of e...
research
11/29/2022

Regret-Optimal Online Caching for Adversarial and Stochastic Arrivals

We consider the online caching problem for a cache of limited size. In a...
research
09/17/2020

Caching in Networks without Regret

We consider the online problem where n users are connected to m caches ...

Please sign up or login with your details

Forgot password? Click here to reset