Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 64, Issue 1, Pages 349-366Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2017.2768517
Keywords
Coded caching; arbitrary popularity distribution; constant-factor performance gap
Funding
- NSF [CNS-1457137, CNS-1703014, 61532012, 61325012, 61601287]
- Army Research Office [W911NF-14-1-0368]
Ask authors/readers for more resources
Caching plays an important role in reducing the backbone traffic when serving high-volume multimedia content. Recently, a new class of coded caching schemes have received significant interest, because they can exploit coded multicast opportunities to further reduce backbone traffic. Without considering file popularity, prior works have characterized the fundamental performance limits of coded caching through a deterministic worst-case analysis. However, when heterogeneous file popularity is considered, there remain open questions regarding the fundamental limits of coded caching performance. In this paper, for an arbitrary popularity distribution, we first derive a new information-theoretic lower bound on the expected transmission rate of any coded caching schemes. We then show that a simple coded-caching scheme attains an expected transmission rate that is at most a constant factor away from the lower bound. Unlike other existing studies, the constant factor that we derived is independent of the popularity distribution.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available