Content Delivery over Broadcast Erasure Channels with Distributed Random Cache
Alireza Vahid, Shih-Chun Lin, I-Hsiang Wang, Yi-Chun Lai

TL;DR
This paper investigates the capacity of content delivery over broadcast erasure channels with distributed random caching at receivers, analyzing how different levels of channel state and cache information at the transmitter affect performance.
Contribution
It derives new capacity bounds for various information availability scenarios, revealing cases where limited information yields optimal capacity.
Findings
Capacity bounds are established for different channel state and cache information levels.
Matching inner and outer bounds characterize the capacity region in several scenarios.
Capacity regions can be identical even with limited channel or cache information.
Abstract
We study the content delivery problem between a transmitter and two receivers through erasure links, when each receiver has access to some random side-information about the files requested by the other user. The random side-information is cached at the receiver via the decentralized content placement. The distributed nature of receiving terminals may also make the erasure state of two links and indexes of the cached bits not perfectly known at the transmitter. We thus investigate the capacity gain due to various levels of availability of channel state and cache index information at the transmitter. More precisely, we cover a wide range of settings from global delayed channel state knowledge and a non-blind transmitter (i.e. one that knows the exact cache index information at each receiver) all the way to no channel state information and a blind transmitter (i.e. one that only…
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.
