Cache-Enabled Erasure Broadcast Channels with Feedback -Asymmetric User Memory Case - Archive ouverte HAL Access content directly
Conference Papers Year :

Cache-Enabled Erasure Broadcast Channels with Feedback -Asymmetric User Memory Case

(1) , (1) , (1)
1
Asma Ghorbel
  • Function : Author
  • PersonId : 975380
Mari Kobayashi
  • Function : Author
  • PersonId : 975381
Sheng Yang

Abstract

We consider a cache-enabled K-user erasure broadcast channel in which a server with a library of N files wishes to deliver a requested file to each user k who is equipped with a cache of a finite memory M k. 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. A two-user toy example shows that the cache network with asymmet-ric memory sizes might achieve better sum rate performance than the network with symmetric memory sizes.
Fichier principal
Vignette du fichier
CacheBPECasymmetricCR3.pdf (372.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01261226 , version 1 (25-01-2016)

Identifiers

  • HAL Id : hal-01261226 , version 1

Cite

Asma Ghorbel, Mari Kobayashi, Sheng Yang. Cache-Enabled Erasure Broadcast Channels with Feedback -Asymmetric User Memory Case. ACM CoNEXT 2015, CCDWN workshop, Dec 2015, Heidelberg, Germany. ⟨hal-01261226⟩
133 View
245 Download

Share

Gmail Facebook Twitter LinkedIn More