Cache-enabled broadcast packet erasure channels with state feedback

Asma Ghorbel, Mari Kobayashi, Sheng Yang

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

21 Scopus citations

Abstract

We consider a cache-enabled K-user broadcast erasure packet channel in which a server with a library of N files wishes to deliver a requested file to each user who is equipped with a cache of a finite memory M. 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 optimal rate region as a function of the memory size, the erasure probability. The proposed delivery scheme, based on the scheme proposed by Gatzianas et al., exploits the receiver side information established during the placement phase. Our results enable us to quantify the net benefits of decentralized coded caching in the presence of erasure. The role of state feedback is found useful especially when the erasure probability is large and/or the normalized memory size is small.

Original languageEnglish
Title of host publication2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1446-1453
Number of pages8
ISBN (Electronic)9781509018239
DOIs
StatePublished - 4 Apr 2016
Externally publishedYes
Event53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 - Monticello, United States
Duration: 29 Sep 20152 Oct 2015

Publication series

Name2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

Conference

Conference53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
Country/TerritoryUnited States
CityMonticello
Period29/09/152/10/15

Fingerprint

Dive into the research topics of 'Cache-enabled broadcast packet erasure channels with state feedback'. Together they form a unique fingerprint.

Cite this