Centralized Coded Caching of Correlated Contents

Coded caching and delivery is studied taking into account the correlations among the contents in the library. Correlations are modeled as common parts shared by multiple contents; that is, each file in the database is composed of a group of subfiles, where each subfile is shared by a different subset of files. The number of files that include a certain subfile is defined as the level of commonness of this subfile. First, a correlation-aware uncoded caching scheme is proposed, and it is shown that the optimal placement for this scheme gives priority to the subfiles with the highest levels of commonness. Then a correlation- aware coded caching scheme is presented, and the cache capacity allocated to subfiles with different levels of commonness is optimized in order to minimize the delivery rate. The proposed correlation-aware coded caching scheme is shown to remarkably outperform state-of-the-art correlation-ignorant solutions, indicating the benefits of exploiting content correlations in coded caching and delivery in networks.

[1]  Deniz Gündüz,et al.  Coded caching for a large number of users , 2016, 2016 IEEE Information Theory Workshop (ITW).

[2]  Urs Niesen,et al.  Decentralized Caching Attains Order-Optimal Memory-Rate Tradeoff , 2013, ArXiv.

[3]  Jaime Llorca,et al.  Rate-memory trade-off for the two-user broadcast caching network with correlated sources , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[4]  Urs Niesen,et al.  Online Coded Caching , 2013, IEEE/ACM Transactions on Networking.

[5]  Mohammad Mohammadi Amiri,et al.  Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off , 2016 .

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

[7]  Deniz Gündüz,et al.  Audience retention rate aware coded video caching , 2017, 2017 IEEE International Conference on Communications Workshops (ICC Workshops).

[8]  Deniz Gündüz,et al.  Improved policy representation and policy search for proactive content caching in wireless networks , 2017, 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

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

[10]  Mehdi Bennis,et al.  Living on the edge: The role of proactive caching in 5G wireless networks , 2014, IEEE Communications Magazine.

[11]  Deniz Gündüz,et al.  Wireless Content Caching for Small Cell and D2D Networks , 2016, IEEE Journal on Selected Areas in Communications.

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

[13]  Jesús Gómez-Vilardebó.  Fundamental Limits of Caching: Improved Bounds with Coded Prefetching , 2016, ArXiv.

[14]  Deniz Gündüz,et al.  Coded Caching and Content Delivery With Heterogeneous Distortion Requirements , 2016, IEEE Transactions on Information Theory.

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

[16]  A. Salman Avestimehr,et al.  The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching , 2016, IEEE Transactions on Information Theory.

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

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