Towards the Exact Rate Memory Tradeoff in Coded Caching

Caching plays an important role in improving internet performance by keeping a fraction of the files closer to the end user. The peak data traffic in the network can be significantly reduced by proper utilization of caching. Recent studies have shown that coded caching does help in further reducing the data traffic over uncoded caching. In this paper, we consider the problem of the exact rate memory tradeoff in coded caching. For the (3, 3) canonical cache network, a new caching scheme to achieve the memory rate pair (5/3,1/2) is introduced. This scheme is further extended to the (4, 4) canonical cache network, to achieve the memory rate pair (11/4,1/3). We prove the optimality of both the proposed schemes by deriving new lower bounds and thus partially characterizing the exact rate memory tradeoff in coded caching.

[1]  A. Salman Avestimehr,et al.  Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2 , 2019, IEEE Transactions on Information Theory.

[2]  Zhi Chen,et al.  Fundamental limits of caching: improved bounds for users with small buffers , 2016, IET Commun..

[3]  Jesús Gómez-Vilardebó,et al.  Fundamental Limits of Caching: Improved Rate-Memory Tradeoff with Coded Prefetching , 2018, 2018 IEEE International Conference on Communications (ICC).

[4]  Urs Niesen,et al.  Coded Caching With Nonuniform Demands , 2017, IEEE Transactions on Information Theory.

[5]  Daniela Tuninetti,et al.  On the optimality of uncoded cache placement , 2015, 2016 IEEE Information Theory Workshop (ITW).

[6]  Suhas N. Diggavi,et al.  Hierarchical coded caching , 2014, 2014 IEEE International Symposium on Information Theory.

[7]  T. Charles Clancy,et al.  Improved approximation of storage-rate tradeoff for caching via new outer bounds , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[8]  Seyed Pooya Shariatpanahi,et al.  Multi-Server Coded Caching , 2015, IEEE Transactions on Information Theory.

[9]  Mohammad Ali Maddah-Ali,et al.  The exact rate-memory tradeoff for caching with uncoded prefetching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[10]  Urs Niesen,et al.  Online coded caching , 2014, ICC.

[11]  Hooshang Ghasemi,et al.  Improved lower bounds for coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[12]  Chao Tian.  A Note on the Fundamental Limits of Coded Caching , 2015, ArXiv.

[13]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

[14]  Chao Tian,et al.  Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[15]  Deniz Gündüz,et al.  Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Tradeoff , 2017, IEEE Transactions on Communications.

[16]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).