Content Delivery in Erasure Broadcast Channels With Cache and Feedback

We study a content delivery problem in a K-user erasure broadcast channel such that a content providing server wishes to deliver requested files to users, each equipped with a cache of a finite size. Assuming that the transmitter has state feedback and user caches can be filled during off-peak hours...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 62; číslo 11; s. 6407 - 6422
Hlavní autoři: Ghorbel, Asma, Kobayashi, Mari, Sheng Yang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Témata:
Broadcasting
Cache
Cache memory
Channels
coded caching
Communication channels
Content delivery
Data transmission
Decentralized
Entropy
erasure broadcast channel
feedback
Information Theory
Mathematical analysis
Mathematics
Memory management
Placement
Probability
Receivers
Servers
State feedback
Wireless communication
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study a content delivery problem in a K-user erasure broadcast channel such that a content providing server wishes to deliver requested files to users, each equipped with a cache of a finite size. Assuming that the transmitter has state feedback and user caches can be filled during off-peak hours reliably by the decentralized content placement, we characterize the achievable rate region as a function of the memory sizes and the erasure probabilities for some special cases. The proposed delivery scheme, based on the broadcasting scheme by Wang and Gatzianas et al., exploits the receiver side information established during the placement phase. Our results can be extended to the centralized content placement as well as multi-antenna broadcast channels with state feedback.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2016.2605123