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

Abstract : This paper considers combination networks with end-user-caches, where a server with N files communicates through H relays (without caches) to K = (H r) 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.
Complete list of metadatas

https://hal-centralesupelec.archives-ouvertes.fr/hal-01742327
Contributor : Pablo Piantanida <>
Submitted on : Saturday, March 24, 2018 - 2:15:16 PM
Last modification on : Wednesday, August 7, 2019 - 3:34:13 PM

Identifiers

Citation

Kai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti. Novel inner bounds with uncoded cache placement for combination networks with end-user-caches. 55th Annual Allerton Conference on Communication, Control, and Computing, Oct 2017, Monticello, United States. pp.361-368, ⟨10.1109/ALLERTON.2017.8262760⟩. ⟨hal-01742327⟩

Share

Metrics

Record views

123