Wireless coded caching: A topological perspective

We explore the performance of coded caching in a SISO BC setting where some users have higher link capacities than others. Focusing on a binary and fixed topological model where strong links have a fixed normalized capacity 1, and where weak links have reduced normalized capacity T < 1, we identify — as a function of the cache size and T — the optimal throughput performance, within a factor of at most 8. The transmission scheme that achieves this performance, employs a simple form of interference enhancement, and exploits the property that weak links attenuate interference, thus allowing for multicasting rates to remain high even when involving weak users. This approach ameliorates the negative effects of uneven topology in multicasting, now allowing all users to achieve the optimal performance associated to T = 1, even if τ is approximately as low as T ≥ 1 − (1 − w)g where g is the coded-caching gain, and where w is the fraction of users that are weak. This leads to the interesting conclusion that for coded multicasting, the weak users need not bring down the performance of all users, but on the contrary to a certain extent, the strong users can lift the performance of the weak users without any penalties on their own performance. Furthermore for smaller ranges of τ, we also see that achieving the near-optimal performance comes with the advantage that the strong users do not suffer any additional delays compared to the case where T = 1.

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

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

[3]  Sanjay Karmakar,et al.  The generalized degrees of freedom of the MIMO interference channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Seyed Pooya Shariatpanahi,et al.  Multi-Server Coded Caching , 2015, IEEE Transactions on Information Theory.

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

[6]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[7]  Shlomo Shamai,et al.  Complete interference mitigation through receiver-caching in Wyner's networks , 2016, 2016 IEEE Information Theory Workshop (ITW).

[8]  P. Vijay Kumar,et al.  Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks , 2005, ArXiv.

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

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

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

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

[13]  Andrea J. Goldsmith,et al.  Relaying in the Presence of Interference: Achievable Rates, Interference Forwarding, and Outer Bounds , 2012, IEEE Transactions on Information Theory.

[14]  Syed Ali Jafar,et al.  Interference Alignment and the Generalized Degrees of Freedom of the $X$ Channel , 2009, IEEE Transactions on Information Theory.

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

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

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

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

[19]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

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

[21]  Michael Gastpar,et al.  Multi-library coded caching , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[22]  Syed Ali Jafar,et al.  Interference alignment and the generalized degrees of freedom of the X channel , 2009, ISIT.

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

[24]  Michèle Wigger,et al.  Noisy Broadcast Networks With Receiver Caching , 2016, IEEE Transactions on Information Theory.

[25]  Sanjay Karmakar,et al.  On the generalized degrees of freedom region of the MIMO interference channel with no CSIT , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[26]  P. Vijay Kumar,et al.  Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes , 2012, IEEE Transactions on Information Theory.

[27]  Syed Ali Jafar,et al.  Transmitter Cooperation under Finite Precision CSIT: A GDoF Perspective , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[28]  Sanjay Karmakar,et al.  The Generalized Degrees of Freedom Region of the MIMO Interference Channel and Its Achievability , 2011, IEEE Transactions on Information Theory.

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

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

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

[32]  Aydin Sezgin,et al.  Cloud Radio Access Networks With Coded Caching , 2016, WSA.

[33]  Aydin Sezgin,et al.  Topological Interference Management with Alternating Connectivity: The Wyner-Type Three User Interference Channel , 2013, ArXiv.

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

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

[36]  Sanjay Karmakar,et al.  The generalized multiplexing gain region of the slow fading MIMO interference channel and its achievability with limited feedback , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[37]  Urs Niesen,et al.  Coded Caching With Nonuniform Demands , 2017, IEEE Trans. Inf. Theory.

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

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

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