The Exact Rate Memory Tradeoff for Small Caches with Coded Placement

02/09/2021
by   Vijith Kumar K P, et al.
0

The idea of coded caching was introduced by Maddah-Ali and Niesen who demonstrated the advantages of coding in caching problems. To capture the essence of the problem, they introduced the (N, K) canonical cache network in which K users with independent caches of size M request files from a server that has N files. Among other results, the caching scheme and lower bounds proposed by them led to a characterization of the exact rate memory tradeoff when M≥N/K(K-1). These lower bounds along with the caching scheme proposed by Chen et al. led to a characterization of the exact rate memory tradeoff when M≤1/K. In this paper we focus on small caches where M∈[0,N/K] and derive new lower bounds. For the case when ⌈K+1/2⌉≤ N ≤ K and M∈[1/K,N/K(N-1)], our lower bounds demonstrate that the caching scheme introduced by Gómez-Vilardebó is optimal and thus extend the characterization of the exact rate memory tradeoff. For the case 1≤ N≤⌈K+1/2⌉, we show that the new lower bounds improve upon the previously known lower bounds.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/24/2021

The Exact Rate Memory Tradeoff for Large Caches with Coded Placement

The idea of coded caching for content distribution networks was introduc...
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...
11/16/2020

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

For caching with nonuniform file popularity, we aim to characterize the ...
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...
03/31/2020

Fundamental Limits of Online Network-Caching

Optimal caching of files in a content distribution network (CDN) is a pr...
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...
01/02/2018

Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels

This paper derives upper and lower bounds on the secrecy capacity-memory...
This week in AI

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