Content Delivery in Erasure Broadcast Channels With Cache and Feedback

We study a content delivery problem in the context of a K-user erasure broadcast channel such that a content providing server wishes to deliver requested files to users, each equipped with a cache of a finite memory. Assuming that the transmitter has state feedback and user caches can be filled during off-peak hours reliably by decentralized cache placement, we characterize the achievable rate region as a function of the memory sizes and the erasure probabilities. The proposed delivery scheme, based on the broadcasting scheme proposed by Wang and Gatzianas et al., exploits the receiver side information established during the placement phase. Our results can be extended to centralized cache placement as well as multi-antenna broadcast channels with state feedback.

[1]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

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

[3]  Giuseppe Caire,et al.  Analog index coding over block-fading MISO broadcast channels with feedback , 2013, 2013 IEEE Information Theory Workshop (ITW).

[4]  Leandros Tassiulas,et al.  Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms , 2010, IEEE Transactions on Information Theory.

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

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

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

[9]  Suhas N. Diggavi,et al.  Effect of number of users in multi-level coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[10]  Sheng Yang,et al.  Content Delivery in Erasure Broadcast Channels With Cache and Feedback , 2016, IEEE Trans. Inf. Theory.

[11]  Mérouane Debbah,et al.  On the benefits of edge caching for MIMO interference alignment , 2015, 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

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

[13]  Petros Elia,et al.  Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback , 2015, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[15]  Sheng Yang,et al.  Secure communication in K-user multi-antenna broadcast channel with state feedback , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[16]  Jingjing Zhang,et al.  Coded caching for reducing CSIT-feedback in wireless communications , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[18]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[19]  Chih-Chun Wang On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback , 2012, IEEE Trans. Inf. Theory.

[20]  Sheng Yang,et al.  Cache-enabled broadcast packet erasure channels with state feedback , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[22]  Sheng Yang,et al.  Cache-enabled erasure broadcast channels with feedback: asymmetric user memory case , 2015, CCDWN '16.

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

[24]  Chih-Chun Wang,et al.  On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback , 2010, IEEE Transactions on Information Theory.

[25]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers , 2013, IEEE Transactions on Information Theory.

[26]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless video content delivery through distributed caching helpers , 2011, 2012 Proceedings IEEE INFOCOM.

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

[28]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .

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

[30]  Jaime Llorca,et al.  Finite-Length Analysis of Caching-Aided Coded Multicasting , 2014, IEEE Transactions on Information Theory.

[31]  Suhas N. Diggavi,et al.  Coded Caching for Heterogeneous Wireless Networks with Multi-level Access , 2014, ArXiv.

[32]  Giuseppe Caire,et al.  Wireless caching: technical misconceptions and business barriers , 2016, IEEE Communications Magazine.

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

[34]  Suhas N. Diggavi,et al.  Content caching and delivery over heterogeneous wireless networks , 2014, 2015 IEEE Conference on Computer Communications (INFOCOM).

[35]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[36]  Giuseppe Caire,et al.  Fundamental limits of distributed caching in D2D wireless networks , 2013, 2013 IEEE Information Theory Workshop (ITW).

[37]  Vinod M. Prabhakaran,et al.  Critical database size for effective caching , 2015, 2015 Twenty First National Conference on Communications (NCC).

[38]  Mohammad Ali Maddah-Ali,et al.  Completely Stale Transmitter Channel State Information is Still Very Useful , 2010, IEEE Transactions on Information Theory.