Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity

by   Yong Deng, et al.

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 K = 2 users, we show that the optimized MCCS attains the lower bound and is optimal for caching with uncoded placement. For general K users with distinct file requests, the optimized MCCS attains the popularity-first-based lower bound. When there are redundant file requests among K 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 and its limitation. Simulation study shows that the loss is very small in general and only exists in some limited cases.



There are no comments yet.


page 1

page 2

page 3

page 4


Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform Random Demands

For a caching system with multiple users, we aim to characterize the mem...

The Exact Rate Memory Tradeoff for Small Caches with Coded Placement

The idea of coded caching was introduced by Maddah-Ali and Niesen who de...

Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement

We study a multi-access variant of the popular coded caching framework, ...

Uncoded Caching and Cross-level Coded Delivery for Non-uniform File Popularity

Proactive content caching at user devices and coded delivery is studied ...

Fundamental Rate-Memory Tradeoff for Coded Caching in Presence of User Inactivity

Coded caching utilizes proper file subpacketization and coded delivery t...

Multi-Transmitter Coded Caching Networks with Transmitter-side Knowledge of File Popularity

This work presents a new way of exploiting non-uniform file popularity i...

On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks

The coded caching scheme is an efficient technique as a solution to redu...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.