Content Delivery in Erasure Broadcast Channels With Cache and Feedback

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 size. 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 for some special cases. 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 the centralized content placement as well as multi-antenna broadcast channels with state feedback.
Document type :
Journal articles
Complete list of metadatas

https://hal-centralesupelec.archives-ouvertes.fr/hal-01433728
Contributor : Sheng Yang <>
Submitted on : Thursday, January 12, 2017 - 10:07:20 PM
Last modification on : Thursday, October 11, 2018 - 4:40:31 PM

Links full text

Identifiers

Citation

Asma Ghorbel, Mari Kobayashi, Sheng Yang. Content Delivery in Erasure Broadcast Channels With Cache and Feedback. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2016, 62 (11), pp.6407-6422. ⟨10.1109/TIT.2016.2605123⟩. ⟨hal-01433728⟩

Share

Metrics

Record views

214