Content Delivery in Erasure Broadcast Channels With Cache and Feedback - CentraleSupélec Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2016

Content Delivery in Erasure Broadcast Channels With Cache and Feedback

Asma Ghorbel
  • Function : Author
  • PersonId : 975380
Mari Kobayashi
  • Function : Author
  • PersonId : 975381
Sheng Yang

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.
Fichier principal
Vignette du fichier
yang_content_delivery.pdf (670.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01433728 , version 1 (28-04-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More