Coded Caching Does Not Generally Benefit From Selfish Caching - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Coded Caching Does Not Generally Benefit From Selfish Caching

Petros Elia

Résumé

In typical coded caching scenarios, the content of a central library is assumed to be of interest to all receiving users. However, in a realistic scenario the users may have diverging interests which may intersect to various degrees. What happens for example if each file is of potential interest to, say, 40 % of the users and each user has potential interest in 40 % of the library? What if then each user caches selfishly only from content of potential interest? In this work, we formulate the symmetric selfish coded caching problem, where each user naturally makes requests from a subset of the library, which defines its own file demand set (FDS), and caches selfishly only contents from its own FDS. For the scenario where the different FDSs symmetrically overlap to some extent, we propose a novel information-theoretic converse that reveals, for such general setting of symmetric FDS structures, that selfish coded caching yields a load performance which is strictly worse-in the non-trivial memory regimethan that in standard coded caching.
Fichier principal
Vignette du fichier
publi-6807.pdf (317.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04094994 , version 1 (11-05-2023)

Identifiants

Citer

Federico Brunero, Petros Elia. Coded Caching Does Not Generally Benefit From Selfish Caching. ISIT 2022, IEEE International Symposium on Information Theory, IEEE, Jun 2022, Espoo, Finland. pp.1139-1144, ⟨10.1109/ISIT50566.2022.9834646⟩. ⟨hal-04094994⟩

Collections

EURECOM
18 Consultations
10 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More