Correlation-aware distributed caching and coded delivery

Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple groupcast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly unpredictable and personalized nature of the content that users consume challenges the efficiency of existing caching-based solutions in which only exact content reuse is explored. This paper generalizes the cache-aided coded multicast problem to a source compression with distributed side information problem that specifically accounts for the correlation among the content files. It is shown how joint file compression during the caching and delivery phases can provide load reductions that go beyond those achieved with existing schemes. This is accomplished through a lower bound on the fundamental rate-memory trade-off as well as a correlation-aware achievable scheme, shown to significantly outperform state-of-the-art correlation-unaware solutions, while approaching the limiting rate-memory trade-off.

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

[2]  Jaime Llorca,et al.  Caching and coded multicasting: Multiple groupcast index coding , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

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

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

[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.  Cache-aided coded multicast for correlated sources , 2016, 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

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

[8]  Jaime Llorca,et al.  On the average performance of caching and coded multicasting with random demands , 2014, 2014 11th International Symposium on Wireless Communications Systems (ISWCS).