Caching in Combination Networks: A Novel Delivery by Leveraging the Network Topology

Maddah-Ali and Niesen (MAN) in 2014 surprisingly showed that it is possible to serve an arbitrarily large number of cache-equipped users with a constant number of transmissions by using coded caching in shared-link broadcast networks. This paper studies the tradeoff between the user's cache size and the file download time for combination networks, where users with caches communicate with the servers through intermediate relays. Motivated by the so-called separation approach, it is assumed that placement and multicast message generation are done according to the MAN original scheme and regardless of the network topology. The main contribution of this paper is the design of a novel two-phase delivery scheme that, accounting to the network topology, outperforms schemes available in the literature. The key idea is to create additional (compared to MAN) multicasting opportunities: in the first phase coded messages are sent with the goal of increasing the amount of `side information' at the users, which is then leveraged during the second phase. The download time with the novel scheme is shown to be proportional to 1=H (with H being the number or relays) and to be order optimal under the constraint of uncoded placement for some parameter regimes.

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

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

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

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

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

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

[7]  Mohammad Ali Maddah-Ali,et al.  Characterizing the rate-memory tradeoff in cache networks within a factor of 2 , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Kai Wan On Caching with More Users than Files , 2018 .

[9]  Daniela Tuninetti,et al.  Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology , 2018, 2018 IEEE International Conference on Communications (ICC).