Combination Networks with or without Secrecy Constraints: The Impact of Caching Relays
Ahmed A. Zewail, and Aylin Yener

TL;DR
This paper introduces a caching scheme for combination networks with relays, optimizing cache placement and delivery, and explores the impact of secrecy constraints on system performance.
Contribution
It develops a MDS coding-based caching scheme, analyzes secrecy constraints, and demonstrates how network topology influences performance under security requirements.
Findings
Server can disengage if caches suffice to store the database.
Lower bounds on delivery load are established using cut-set arguments.
Secrecy constraints significantly affect network performance.
Abstract
This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users. In particular, a new model is investigated where the intermediate relays employ caches in addition to the end users. First, a new centralized coded caching scheme is developed that utilizes maximum distance separable (MDS) coding, jointly optimizes cache placement and delivery phase, and enables decomposing the combination network into a set virtual multicast sub-networks. It is shown that if the sum of the memory of an end user and its connected relay nodes is sufficient to store the database, then the server can disengage in the delivery phase and all the end users' requests can be satisfied by the caches in the network. Lower bounds on the normalized delivery load using genie-aided cut-set arguments are presented along with second…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
