On Coded Caching Systems with Offline Users

TL;DR

This paper extends coded caching models to include offline users, providing bounds and conditions for optimality, revealing that the load-memory tradeoff depends only on active users, not total users.

Contribution

It introduces a new coded caching model with offline users, deriving bounds and conditions for optimality, and characterizing the load-memory tradeoff in this setting.

Findings

Optimal load-memory tradeoff depends only on active users.

Bounds are tight when conditions for optimality are met.

The model generalizes existing coded caching frameworks to include offline users.

Abstract

Coded caching is a technique that leverages locally cached contents at the users to reduce the network's peak-time communication load. Coded caching achieves significant performance gains compared to uncoded caching schemes and is thus a promising technique to boost performance in future networks. In the original model introduced by Maddah-Ali and Niesen (MAN), a server stores multiple files and is connected to multiple cache-aided users through an error-free shared link; once the local caches have been filled and all users have sent their demand to the server, the server can start sending coded multicast messages to satisfy all users' demands. A practical limitation of the original MAN model is that it halts if the server does not receive all users' demands, which is the limiting case of asynchronous coded caching when the requests of some users arrive with infinite delay. In this paper we formally define a coded caching system where some users are offline. We propose achievable and converse bounds for this novel setting and show under which conditions they meet, thus providing an optimal solution, and when they are to within a constant multiplicative gap of two. Interestingly, when optimality can be be shown, the optimal load-memory tradeoff only depends on the number active users, and not on the total (active plus offline) number of users.