A layered caching architecture for the interference channel

Recent work has studied the benefits of caching in the interference channel, particularly by placing caches at the transmitters. In this paper, we study the two-user Gaussian interference channel in which caches are placed at both the transmitters and the receivers. We propose a separation strategy that divides the physical and network layers. While a natural separation approach might be to abstract the physical layer into several independent bit pipes at the network layer, we argue that this is inefficient. Instead, the separation approach we propose exposes interacting bit pipes at the network layer, so that the receivers observe related (yet not identical) quantities. We find the optimal strategy within this layered architecture, and we compute the degrees-of-freedom it achieves. Finally, we show that separation is optimal in regimes where the receiver caches are large.

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

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

[3]  Giuseppe Caire,et al.  Wireless Device-to-Device Caching Networks: Basic Principles and System Performance , 2013, IEEE Journal on Selected Areas in Communications.

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

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

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

[7]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

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

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

[10]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[11]  John G. van Bosse,et al.  Wiley Series in Telecommunications and Signal Processing , 2006 .

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

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

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

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

[16]  Urs Niesen,et al.  The Degrees of Freedom of Compute-and-Forward , 2011, IEEE Transactions on Information Theory.

[17]  Amir K. Khandani,et al.  Real Interference Alignment: Exploiting the Potential of Single Antenna Systems , 2009, IEEE Transactions on Information Theory.

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

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

[20]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.