Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity
Yong Deng, Min Dong

TL;DR
This paper analyzes the tradeoff between memory and rate in caching systems with nonuniform file popularity, introducing bounds and showing the optimality of a modified caching scheme under uncoded placement.
Contribution
It provides new information-theoretic lower bounds and proves the optimality of the MCCS scheme for certain user scenarios with nonuniform popularity.
Findings
MCCS attains the lower bound for 2 users, proving optimality.
For multiple users, MCCS achieves the popularity-first-based lower bound.
Zero-padding causes a small gap in some cases, with minimal impact observed.
Abstract
For caching with nonuniform file popularity, we aim to characterize the memory-rate tradeoff under uncoded cache placement. We consider the recently proposed Modified Coded Caching Scheme (MCCS) with the optimized cache placement based on the popularity-first approach to minimize the average delivery rate. We introduce two information-theoretic lower bounds on the average rate for caching under uncoded placement. For users, we show that the optimized MCCS attains the lower bound and is optimal for caching with uncoded placement. For general users with distinct file requests, the optimized MCCS attains the popularity-first-based lower bound. When there are redundant file requests among users, we show a possible gap between the optimized MCCS and the lower bounds, which is attributed to zero-padding commonly used for coded delivery. We analyze the impact of zero-padding…
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 · Cooperative Communication and Network Coding · Advanced Data Storage Technologies
