Coded caching for a large number of users

We consider the coded caching problem with a central server containing N files, each of length F bits, and K users, each equipped with a cache of capacity MF bits. We assume that coded contents can be proactively placed into users' caches at no cost during the placement phase. During the delivery phase, each user requests exactly one file from the database, and all the requests are served simultaneously by the server over an error-free common link. The goal is to utilize the local cache memories at the users to reduce the delivery rate from the server during the peak period. Here, we focus on a system which has more users than files, i.e., K > N. We first consider the centralized caching problem, in which the number and identity of active users are known in advance, and propose a group-based coded caching scheme for M = N/K, which improves upon the best achievable scheme in the literature. The proposed centralized caching scheme is then exploited in a decentralized setting, in which neither the number nor the identity of the active users are known during the placement phase. It is shown that the proposed coded caching scheme improves upon the best known decentralized delivery rate as well.

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

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

[3]  Deniz Gündüz,et al.  Multi-armed bandit optimization of cache content in wireless infostation networks , 2014, 2014 IEEE International Symposium on Information Theory.

[4]  Chaitanya Swamy,et al.  Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..

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

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

[7]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

[9]  Deniz Gündüz,et al.  Improved delivery rate-cache capacity trade-off for centralized coded caching , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

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

[11]  Mohammad Ali Maddah-Ali,et al.  Fundamental limits of cache-aided interference management , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[12]  Alexandros G. Dimakis,et al.  Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution , 2012, IEEE Communications Magazine.

[13]  Michele A. Wigger,et al.  Joint cache-channel coding over erasure broadcast channels , 2015, 2015 International Symposium on Wireless Communication Systems (ISWCS).

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

[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]  Suhas N. Diggavi,et al.  Hierarchical coded caching , 2014, 2014 IEEE International Symposium on Information Theory.

[17]  Jaime Llorca,et al.  Distortion-memory tradeoffs in cache-aided wireless video delivery , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[19]  Zhi Chen.  Fundamental Limits of Caching: Improved Bounds For Small Buffer Users , 2014, ArXiv.

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

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

[22]  Kai Wan.  On Caching with More Users than Files , 2018 .

[23]  Urs Niesen,et al.  Cache-aided interference channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[25]  Feng Yang,et al.  The Performance Analysis of Coded Cache in Wireless Fading Channel , 2015, ArXiv.

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

[27]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..

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

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

[30]  Deniz Gündüz,et al.  Centralized coded caching for heterogeneous lossy requests , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).