Cache-Enabled Broadcast Packet Erasure Channels with State Feedback

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.

8 pages, 4 figures, to be presented at the 53rd Annual Allerton Conference on Communication, Control, and Computing, IL, USA

References in corpus (4)

• Order-Optimal Rate of Caching and Coded Multicasting with Random Demands
• Effect of Number of Users in Multi-level Coded Caching
• The Performance Analysis of Coded Cache in Wireless Fading Channel
• Fundamental Limits of Distributed Caching in D2D Wireless Networks

Cited by in corpus (5)

• Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback
• Wireless Coded Caching: A Topological Perspective
• The Synergistic Gains of Coded Caching and Delayed Feedback
• Feedback-Aided Coded Caching for the MISO BC with Small Caches
• Content Delivery in Erasure Broadcast Channels with Cache and Feedback