Novel inner bounds with uncoded cache placement for combination networks with end-user-caches

This paper considers combination networks with end-user-caches, where a server with N files communicates through H relays (without caches) to K = (Hr) users equipped with caches of size M files. In this setting, each user is connected to a different subset of r relays. The tradeoff between the cache size and the worst-case download time is studied. Several novel caching schemes are proposed, which leverage the symmetries of combination networks and interference elimination at the end-users. The proposed schemes are proved: (i) to be optimal for some choices of the parameters (N, M, H, r) under the constraint of uncoded cache placement, and (ii) to outperform the state-of-the-art schemes in numerical evaluations.

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

[2]  Jaime Llorca,et al.  On the fundamental limits of caching in combination networks , 2015, 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

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

[4]  Daniela Tuninetti,et al.  On the optimality of uncoded cache placement , 2015, 2016 IEEE Information Theory Workshop (ITW).

[5]  Raymond W. Yeung,et al.  Network coding gain of combination networks , 2004, Information Theory Workshop.

[6]  Ming Xiao,et al.  A Binary Coding Approach for Combination Networks and General Erasure Networks , 2007, 2007 IEEE International Symposium on Information Theory.

[7]  Li Tang,et al.  Coded caching for networks with the resolvability property , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[8]  Pawel Petecki.  On cyclic Hamiltonian decompositions of complete k-uniform hypergraphs , 2014, Discret. Math..

[9]  Daniela Tuninetti,et al.  Novel Outer Bounds and Inner Bounds with Uncoded Cache Placement for Combination Networks with End-User-Caches , 2017 .

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

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

[12]  Aylin Yener,et al.  Coded caching for combination networks with cache-aided relays , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).