Interplay of Cache Sizes and File Popularity in Coded Caching

Coded caching is a caching technique proposed recently, which can greatly reduce backhaul traffic by exploiting the multicast transmissions over different users, even when they request distinct files. The transmission gain of coded caching depends on the distribution of users' cache size and also the distribution of file popularity. While the impacts of user caches or file popularity has been investigated independently, their joint impact on coded caching is unknown and challenging to be analyzed. In this paper, we propose a scheme considering the cache sizes distribution and file popularity distribution simultaneously. The average transmission rate and the lower bound are both analyzed. The gap between the two rates is at most an O(logK) factor, where K is the number of users. Simulation results show superior performance of the proposed scheme.

[1]  Jingjing Zhang,et al.  Wireless coded caching: A topological perspective , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[2]  A. Field.  Communications , 1963, The Journal of Asian Studies.

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

[4]  Xiaohu Tang,et al.  On the Placement Delivery Array Design for Centralized Coded Caching Scheme , 2015, IEEE Transactions 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]  Hui Liu,et al.  Communications, Caching, and Computing for Mobile Virtual Reality: Modeling and Tradeoff , 2018, IEEE Transactions on Communications.

[7]  Aylin Yener,et al.  Device-to-Device Coded Caching with Heterogeneous Cache Sizes , 2018, 2018 IEEE International Conference on Communications (ICC).

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

[9]  Meixia Tao,et al.  Fundamental Tradeoff Between Storage and Latency in Cache-Aided Wireless Interference Networks , 2016, IEEE Transactions on Information Theory.

[10]  Aylin Yener,et al.  Centralized Coded Caching with Heterogeneous Cache Sizes , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[11]  Deniz Gündüz,et al.  Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

[13]  Xinbing Wang,et al.  Coded caching under arbitrary popularity distributions , 2015, 2015 Information Theory and Applications Workshop (ITA).

[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.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[16]  Xinbing Wang,et al.  Coded caching for files with distinct file sizes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[17]  Sinong Wang,et al.  Coded Caching with Heterogenous Cache Sizes , 2015 .

[18]  Deniz Gündüz,et al.  Decentralized Caching and Coded Delivery With Distinct Cache Capacities , 2017, IEEE Transactions on Communications.

[19]  Suhas N. Diggavi,et al.  Multi-level coded caching , 2014, 2014 IEEE International Symposium on Information Theory.