On the Design and Analysis of Optimal Wireless Caching Schemes With Placement Cost and Unlimited Memory

Coded caching has been shown to result in significant throughput gains, but its gains were proved only by assuming a placement phase with no transmission cost. A free placement phase is, however, an unrealistic assumption that could stand as an obstacle towards delivering the promise of coded caching. In this letter, we focus on analyzing the effect of the placement communication cost on the overall throughput and the structure of the optimal caching scheme, under the assumptions of the worst case traffic pattern and unlimited memory at the end users. Interestingly, we find relevant network configurations where uncoded caching is the optimal solution.

[1]  A. Salman Avestimehr,et al.  The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching , 2016, IEEE Transactions on Information Theory.

[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]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[4]  Aylin Yener,et al.  Coded Caching for Heterogeneous Systems: An Optimization Perspective , 2018, IEEE Transactions on Communications.

[5]  Wei Yu,et al.  Optimization of Heterogeneous Coded Caching , 2017, IEEE Transactions on Information Theory.

[6]  Aimin Tang,et al.  Coded Caching for Wireless Backhaul Networks With Unequal Link Rates , 2018, IEEE Transactions on Communications.

[7]  Hui Liu,et al.  Structural Properties of Uncoded Placement Optimization for Coded Delivery , 2017, ArXiv.

[8]  Sergio Verdú,et al.  On channel capacity per unit cost , 1990, IEEE Trans. Inf. Theory.

[9]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[10]  Aly El Gamal,et al.  Towards Jointly Optimal Placement and Delivery: To Code or Not to Code in Wireless Caching Networks , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[11]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.