Cache-enabled erasure Broadcast channels with feedback -asymmetric user memory case

Asma Ghorbel, Mari Kobayashi, Sheng Yang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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 Mk. 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 twouser toy example shows that the cache network with asymmetric memory sizes might achieve better sum rate performance than the network with symmetric memory sizes.

Original languageEnglish
Title of host publicationProceedings of the 1st Workshop on Content Caching and Delivery in Wireless Networks, CCDWN 2016
PublisherAssociation for Computing Machinery, Inc
ISBN (Electronic)9781450340540
DOIs
StatePublished - 1 Dec 2016
Externally publishedYes
Event1st Workshop on Content Caching and Delivery in Wireless Networks, CCDWN 2016 - Heidelberg, Germany
Duration: 1 Dec 20164 Dec 2016

Publication series

NameProceedings of the 1st Workshop on Content Caching and Delivery in Wireless Networks, CCDWN 2016

Conference

Conference1st Workshop on Content Caching and Delivery in Wireless Networks, CCDWN 2016
Country/TerritoryGermany
CityHeidelberg
Period1/12/164/12/16

Fingerprint

Dive into the research topics of 'Cache-enabled erasure Broadcast channels with feedback -asymmetric user memory case'. Together they form a unique fingerprint.

Cite this