The Exact Rate Memory Tradeoff for Large Caches with Coded Placement

01/24/2021
by   Vijith Kumar K P, et al.
0

The idea of coded caching for content distribution networks was introduced by Maddah-Ali and Niesen, who considered the canonical (N, K) cache network in which a server with N files satisfy the demands of K users (equipped with independent caches of size M each). Among other results, their work provided a characterization of the exact rate memory tradeoff for the problem when M≥N/K(K-1). In this paper, we improve this result for large caches with M≥N/K(K-2). For the case ⌈K+1/2⌉≤ N ≤ K, we propose a new coded caching scheme, and derive a matching lower bound to show that the proposed scheme is optimal. This extends the characterization of the exact rate memory tradeoff to the case M≥N/K(K-2+(K-2+1/N)/(K-1)). For the case 1≤ N≤⌈K+1/2⌉, we derive a new lower bound, which demonstrates that the scheme proposed by Yu et al. is optimal and thus extend the characterization of the exact rate memory tradeoff to the case M≥N/K(K-2).

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/09/2021

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...
05/21/2019

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...
05/12/2020

Characterizing Linear Memory-Rate Tradeoff of Coded Caching: The (N,K)=(3,3) Case

We consider the cache problem introduced by Maddah-ali and Niesen [1] fo...
03/17/2021

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...
07/11/2018

On the Fundamental Limits of Coded Data Shuffling for Distributed Learning Systems

We consider the data shuffling problem in a distributed learning system,...
08/19/2019

Cache Subsidies for an Optimal Memory for Bandwidth Tradeoff in the Access Network

While the cost of the access network could be considerably reduced by th...
06/20/2020

Asymptotically Optimal Exact Minibatch Metropolis-Hastings

Metropolis-Hastings (MH) is a commonly-used MCMC algorithm, but it can b...
This week in AI

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