Noisy Broadcast Networks with Receiver Caching
Shirin Saeedi Bidokhti, Mich\`ele Wigger, Roy Timo

TL;DR
This paper investigates the capacity limits of noisy broadcast networks with receiver caching, introducing new coding strategies and bounds that improve understanding of rate-memory tradeoffs in such systems.
Contribution
It proposes a novel joint cache-channel coding scheme that tightens bounds on capacity-memory tradeoff in noisy broadcast networks with receiver caches.
Findings
Lower and upper bounds are tight for single weak receiver scenarios.
New coding scheme outperforms separate cache-channel coding.
Complete characterization of rate-memory tradeoff for symmetric demands.
Abstract
We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with all-equal erasure probabilities and equal cache sizes and a set of strong receivers with all-equal erasure probabilities and no cache memories. We present lower and upper bounds on the capacity-memory tradeoff of this network. The lower bound is achieved by a new joint cache-channel coding idea and significantly improves on schemes that are based on separate cache-channel coding. We discuss how this coding idea could be extended to more general discrete memoryless broadcast channels and to unequal cache sizes. Our upper bound holds for all stochastically degraded broadcast channels. For the…
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.
