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.
https://hal-centralesupelec.archives-ouvertes.fr/hal-01261226
Contributor : Sheng Yang
<>
Submitted on : Monday, January 25, 2016 - 12:04:42 AM
Last modification on : Thursday, April 5, 2018 - 12:30:05 PM
Long-term archiving on : Tuesday, April 26, 2016 - 10:19:33 AM
