Coded Caching With Nonuniform Demands

DOI10.1109/TIT.2016.2639522MaRDI QIDQ2989647zbMATH OpenOpenAlexFDO

Authors Urs Niesen, Mohammad Ali Maddah-Ali

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1308.0178

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30)

Abstract: We consider a network consisting of a file server connected through a shared link to a number of users, each equipped with a cache. Knowing the popularity distribution of the files, the goal is to optimally populate the caches such as to minimize the expected load of the shared link. For a single cache, it is well known that storing the most popular files is optimal in this setting. However, we show here that this is no longer the case for multiple caches. Indeed, caching only the most popular files can be highly suboptimal. Instead, a fundamentally different approach is needed, in which the cache contents are used as side information for coded communication over the shared link. We propose such a coded caching scheme and prove that it is close to optimal.

Cited in

(7)

• Information-Theoretic Caching: Sequential Coding for Computing
• Hierarchical Coded Caching
• Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach
• Subexponential and Linear Subpacketization Coded Caching via Projective Geometry
• Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching
• Adaptive Coded Caching for Fair Delivery Over Fading Channels
• Improved hotplug caching schemes using PDAs and t-designs

This page was built for publication: Coded Caching With Nonuniform Demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989647)