Alpha fair coded caching

The performance of existing coded caching schemes is sensitive to the worst channel quality, when applied to wireless channels. In this paper, we address this limitation in the following manner: in short-term, we allow transmissions to subsets of users with good channel quality, avoiding users with fades, while in long-term we ensure fairness across the different users. Our online delivery scheme combines (i) joint scheduling and power control for the fading broadcast channel, and (ii) congestion control for ensuring the optimal long-term average performance. By restricting the caching operations to decentralized coded caching proposed in the literature, we prove that our proposed scheme has near-optimal overall performance with respect to the long-term alpha fairness performance. By tuning the coefficient alpha, the operator can differentiate the user performance in terms of video delivery rates achievable by coded caching. We demonstrate via simulations that our scheme outperforms standard coded caching and unicast opportunistic scheduling, which are identified as special cases of our general framework.

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

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

[3]  Ralf R. Müller,et al.  Hard Fairness Versus Proportional Fairness in Wireless Communications: The Single-Cell Case , 2007, IEEE Transactions on Information Theory.

[4]  John M. Cioffi,et al.  Queue proportional scheduling via geometric programming in fading broadcast channels , 2006, IEEE Journal on Selected Areas in Communications.

[5]  David Tse,et al.  Optimal power allocation over parallel Gaussian broadcast channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[6]  Eytan Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

[7]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

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

[9]  Giuseppe Caire,et al.  MIMO downlink scheduling with non-perfect channel state knowledge , 2009, 2009 IEEE Information Theory Workshop.

[10]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

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

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

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

[14]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

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

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

[17]  Sheng Yang,et al.  Cache-aided content delivery in MIMO channels , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

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

[20]  Urs Niesen,et al.  Coded caching for delay-sensitive content , 2014, 2015 IEEE International Conference on Communications (ICC).

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

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

[23]  Atilla Eryilmaz,et al.  Throughput-optimal scheduling for broadcast channels , 2001, SPIE ITCom.

[24]  Alexander L. Stolyar,et al.  On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..