Rate-memory trade-off for the two-user broadcast caching network with correlated sources

This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. First, a lower bound on the optimal peak rate-memory trade-off is provided. Then, in order to leverage the correlation among the library files to alleviate the load over the shared link, a two-step correlation-aware cache-aided coded multicast (CACM) scheme is proposed. The first step uses Gray-Wyner source coding to represent the library via one common and two private descriptions, such that a second correlation-unaware multiple-request CACM step can exploit the additional coded multicast opportunities that arise. It is shown that the rate achieved by the proposed two-step scheme matches the lower bound for a significant memory regime and it is within half of the conditional entropy for all other memory values.

[1]  Jaime Llorca,et al.  Minimum cost caching-aided multicast under arbitrary demand , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[2]  Robert M. Gray,et al.  Source coding for a simple network , 1974 .

[3]  Daniela Tuninetti,et al.  On caching with more users than files , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[4]  Jaime Llorca,et al.  Cache-aided coded multicast for correlated sources , 2016, 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[5]  Jaime Llorca,et al.  Order-Optimal Rate of Caching and Coded Multicasting With Random Demands , 2015, IEEE Transactions on Information Theory.

[6]  Jaime Llorca,et al.  Network-coded caching-aided multicast for efficient content delivery , 2013, 2013 IEEE International Conference on Communications (ICC).

[7]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[8]  Bernhard C. Geiger,et al.  A Rate-Distortion Approach to Caching , 2016, IEEE Transactions on Information Theory.

[9]  Jaime Llorca,et al.  Caching-aided coded multicasting with multiple random requests , 2015, 2015 IEEE Information Theory Workshop (ITW).

[10]  Michael Gastpar,et al.  Information theoretic caching: The multi-user case , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[12]  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).

[13]  Jaime Llorca,et al.  Correlation-aware distributed caching and coded delivery , 2016, 2016 IEEE Information Theory Workshop (ITW).

[14]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.