Coded Caching With Asymmetric Cache Sizes and Link Qualities: The Two-User Case

The centralized coded caching problem is studied for the two-user scenario, considering heterogeneous cache capacities at the users and private channels from the server to the users, in addition to a shared channel. Optimal caching and delivery strategies that minimize the worst-case delivery latency are presented for an arbitrary number of files. The converse proof follows from the sufficiency of file-index-symmetric caching and delivery codes, while the achievability is obtained through memory-sharing among a number of special memory-capacity pairs. The optimal scheme is shown to exploit the private link capacities by transmitting part of the corresponding user‘s request in an uncoded fashion. When there are no private links, the results presented here improve upon the two known results in the literature, namely: 1) equal cache capacities and arbitrary number of files and 2) unequal cache capacities and two files. The results are then extended to the caching problem with heterogeneous distortion requirements.

[1]  Zhi Chen,et al.  Fundamental limits of caching: improved bounds for users with small buffers , 2016, IET Commun..

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

[3]  Mohammad Ali Maddah-Ali,et al.  On the optimality of separation between caching and delivery in general cache networks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[4]  Deniz Gündüz,et al.  Caching and Coded Delivery Over Gaussian Broadcast Channels for Energy Efficiency , 2018, IEEE Journal on Selected Areas in Communications.

[5]  Chao Tian.  Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes , 2014, IEEE Journal on Selected Areas in Communications.

[6]  Chao Tian,et al.  Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[7]  Aylin Yener,et al.  Benefits of Coded Placement for Networks with Heterogeneous Cache Sizes , 2018, 2018 52nd Asilomar Conference on Signals, Systems, and Computers.

[8]  Parastoo Sadeghi,et al.  Distributed index coding , 2016, 2016 IEEE Information Theory Workshop (ITW).

[9]  Deniz Gündüz,et al.  Cache-Aided Content Delivery Over Erasure Broadcast Channels , 2017, IEEE Transactions on Communications.

[10]  Mohammad Ali Maddah-Ali,et al.  The exact rate-memory tradeoff for caching with uncoded prefetching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[11]  Deniz Gündüz,et al.  Decentralized Caching and Coded Delivery With Distinct Cache Capacities , 2017, IEEE Transactions on Communications.

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

[13]  Michele A. Wigger,et al.  Erasure broadcast networks with receiver caching , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[14]  Deniz Gündüz,et al.  On the Capacity Region of a Cache-Aided Gaussian Broadcast Channel with Multi-Layer Messages , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[15]  A. Salman Avestimehr,et al.  Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2 , 2019, IEEE Transactions on Information Theory.

[16]  Aylin Yener,et al.  Benefits of Cache Assignment on Degraded Broadcast Channels , 2019, IEEE Transactions on Information Theory.

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

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

[19]  Aylin Yener,et al.  Centralized Coded Caching with Heterogeneous Cache Sizes , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[20]  Lawrence Ong,et al.  The Single-Uniprior Index-Coding Problem: The Single-Sender Case and the Multi-Sender Extension , 2016, IEEE Transactions on Information Theory.

[21]  T. Charles Clancy,et al.  Layered caching for heterogeneous storage , 2016, 2016 50th Asilomar Conference on Signals, Systems and Computers.

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

[23]  Aylin Yener,et al.  Optimization of heterogeneous caching systems with rate limited links , 2017, 2017 IEEE International Conference on Communications (ICC).

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

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

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

[27]  Lawrence Ong,et al.  Improved bounds for multi-sender index coding , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[28]  Jaime Llorca,et al.  Caching and coded multicasting: Multiple groupcast index coding , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[29]  Lawrence Ong,et al.  Graph-Theoretic Approaches to Two-Sender Index Coding , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[30]  Jesús Gómez-Vilardebó.  Fundamental Limits of Caching: Improved Bounds with Coded Prefetching , 2016, ArXiv.

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

[32]  Hyo Seung Kang,et al.  The K-User Linear Deterministic Broadcast Channel with Receiver Memory , 2017, 2017 IEEE Globecom Workshops (GC Wkshps).

[33]  Deniz Gündüz,et al.  Coded caching for a large number of users , 2016, 2016 IEEE Information Theory Workshop (ITW).

[34]  Deniz Gündüz,et al.  Coded Caching and Content Delivery With Heterogeneous Distortion Requirements , 2016, IEEE Transactions on Information Theory.

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

[36]  Lawrence Ong,et al.  Cooperative Multi-Sender Index Coding , 2019, IEEE Transactions on Information Theory.