DeepAI AI Chat
Log In Sign Up

Optimal Demand Private Coded Caching for Users with Small Buffers

Coded Caching is an efficient technique to reduce peak hour network traffic. One limitation of known coded caching schemes is that the demands of all users are revealed to their peers in the delivery phase. Schemes that assure privacy for user demands are studied in recent past. Assuming that the users are equipped with caches of small memory sizes, the achievable rate under demand privacy constraints is investigated in this work. We present an MDS code based demand private coded caching scheme with K users and N files that achieves a memory rate pair (1/K(N-1)+1,N(1-1/K(N-1)+1)). The presented memory-rate pair meets the lower bound under demand-privacy requirements, proposed by Yan et al. in the recent work <cit.>. By memory sharing this characterizes the exact rate-memory trade-off for the demand private coded caching scheme for cache memory M∈[0,1/K(N-1)+1].


page 1

page 2

page 3

page 4


Demand-Private Coded Caching and the Exact Trade-off for N=K=2

The distributed coded caching problem has been studied extensively in th...

Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K, 1/(K-1))

Maddah-Ali and Niesen, in a seminal paper, introduced the notion of code...

Coded Caching with Demand Privacy: Constructions for Lower Subpacketization and Generalizations

Coded caching is a technique where we utilize multi-casting opportunitie...

Demand Private Coded Caching

The work by Maddah-Ali and Niesen demonstrated the benefits in reducing ...

Fundamental Limits of Caching for Demand Privacy against Colluding Users

This work investigates the problem of demand privacy against colluding u...

Novel Decentralized Coded Caching through Coded Prefetching

We propose a new decentralized coded caching scheme for a two-phase cach...

An Index Coding Approach to Caching with Uncoded Cache Placement

Caching is an efficient way to reduce network traffic congestion during ...