Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching
Federico Brunero, Petros Elia

TL;DR
This paper demonstrates that selfish coded caching strategies, where users cache only their own interests, can lead to unbounded inefficiencies compared to unselfish caching, especially as the number of users grows.
Contribution
The paper introduces a new information-theoretic converse showing that selfish caching can cause unbounded load increases, providing bounds on the coding gain loss in symmetric FDS structures.
Findings
Selfish caching can cause unbounded load increases compared to unselfish caching.
The optimal selfish coding gain is at most 1/(1 - δ), independent of the number of users.
Derived bounds are exact for various demand types.
Abstract
The original coded caching scenario assumes a content library that is of interest to all receiving users. In a realistic scenario though, 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, of the users and each user has potential interest in of the library? In this work, we investigate the so-called symmetrically selfish coded caching scenario, where each user only makes requests from a subset of the library that defines its own File Demand Set (FDS), each user caches selfishly only contents from its own FDS, and where the different FDSs symmetrically overlap to some extent. In the context of various traditional prefetching scenarios (prior to the emergence of coded caching), selfish approaches were known to be potentially very effective. On the other hand, with the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Advanced Data Storage Technologies · Opportunistic and Delay-Tolerant Networks
