Skip to Main content Skip to Navigation
Conference papers

Content delivery in erasure broadcast channels with cache and feedback

Abstract : We study a content delivery problem in the context of 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 decentralized cache 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 proposed by Wang and Gatzianas et al., exploits the receiver side information established during the placement phase. Our results can be extended to centralized cache placement as well as multi-antenna broadcast channels with state feedback.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-centralesupelec.archives-ouvertes.fr/hal-01433731
Contributor : Sheng Yang <>
Submitted on : Wednesday, June 10, 2020 - 3:55:02 PM
Last modification on : Wednesday, September 16, 2020 - 4:51:02 PM

File

hal-01433731.pdf
Files produced by the author(s)

Identifiers

Citation

Asma Ghorbel, Mari Kobayashi, Sheng Yang. Content delivery in erasure broadcast channels with cache and feedback. 2016 IEEE International Symposium on Information Theory (ISIT), Jul 2016, Barcelona, Spain. ⟨10.1109/ISIT.2016.7541416⟩. ⟨hal-01433731⟩

Share

Metrics

Record views

235

Files downloads

28