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.
Type de document :
Communication dans un congrès
ACM CoNEXT 2015, CCDWN workshop, Dec 2015, Heidelberg, Germany
https://hal-centralesupelec.archives-ouvertes.fr/hal-01261226
Contributeur : Sheng Yang
<>
Soumis le : lundi 25 janvier 2016 - 00:04:42
Dernière modification le : jeudi 5 avril 2018 - 12:30:05
Document(s) archivé(s) le : mardi 26 avril 2016 - 10:19:33
