Content Delivery in Erasure Broadcast Channels with Cache and Feedback
arXiv:1602.04630
Abstract
We study a content delivery problem in a K-user erasure broadcast channel such that a content providing server wishes to deliver requested files to users, each equipped with a cache of a finite memory. Assuming that the transmitter has state feedback and user caches can be filled during off-peak hours reliably by the decentralized content placement, we characterize the achievable rate region as a function of the memory sizes and the erasure probabilities. The proposed delivery scheme, based on the broadcasting scheme by Wang and Gatzianas et al., exploits the receiver side information established during the placement phase. Our results can be extended to centralized content placement as well as multi-antenna broadcast channels with state feedback.
arXiv comment29 pages, 7 figures. A short version has been submitted to ISIT 2016
References in corpus (10)
- Multiuser broadcast erasure channel with feedback - capacity and algorithms
- Content Caching and Delivery over Heterogeneous Wireless Networks
- Order-Optimal Rate of Caching and Coded Multicasting with Random Demands
- Effect of Number of Users in Multi-level Coded Caching
- Coded Caching with Heterogenous Cache Sizes
- The Performance Analysis of Coded Cache in Wireless Fading Channel
- Hierarchical Coded Caching
- Critical Database Size for Effective Caching
- Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback
- Cache-Enabled Broadcast Packet Erasure Channels with State Feedback