Joint cache-channel coding over erasure broadcast channels

@article{Timo2015JointCC,
  title={Joint cache-channel coding over erasure broadcast channels},
  author={Roy C. Timo and Mich{\`e}le A. Wigger},
  journal={2015 International Symposium on Wireless Communication Systems (ISWCS)},
  year={2015},
  pages={201-205}
}
  • R. Timo, M. Wigger
  • Published 5 May 2015
  • Computer Science
  • 2015 International Symposium on Wireless Communication Systems (ISWCS)
We consider a cache-aided communications system in which a transmitter communicates with many receivers over an erasure broadcast channel. The system serves as a basic model for communicating on-demand content during periods of high network congestion, where some content can be pre-placed in local caches near the receivers. We formulate the cache-aided communications problem as a joint cache-channel coding problem, and characterise some information-theoretic tradeoffs between reliable… 
Erasure broadcast networks with receiver caching
TLDR
Achievable and converse bounds for the optimal capacity-memory tradeoff are derived and new joint cache-channel coding schemes that significantly outperform naive separate cache- channel coding schemes are proved.
Content delivery in erasure broadcast channels with cache and feedback
TLDR
The achievable rate region is characterized as a function of the memory sizes and the erasure probabilities, and 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.
Cache-aided data delivery over erasure broadcast channels
TLDR
A joint caching and channel coding scheme is proposed such that all the receivers, even the receivers without any cache memories, benefit from the presence of caches across the network.
Cache-Aided Content Delivery Over Erasure Broadcast Channels
TLDR
A cache-aided broadcast network is studied, in which a server delivers contents to a group of receivers over a packet erasure broadcast channel, and it is shown that all the receivers, even those without any cache memories, benefit from the presence of caches across the network.
Cache-Aided Content Delivery Over Erasure Broadcast Channels
TLDR
A cache-aided broadcast network is studied, in which a server delivers contents to a group of receivers over a packet erasure broadcast channel, and it is shown that all the receivers, even those without any cache memories, benefit from the presence of caches across the network.
Secure Joint Cache-Channel Coding over Erasure Broadcast Channels
TLDR
Upper and lower bounds on the secure capacity-memory tradeoff of the two-user wiretap erasure BC with cache memory at the weaker receiver are derived, showing that cache memories provide larger gains under a secrecy constraint than without such a constraint.
Cache-enabled broadcast packet erasure channels with state feedback
TLDR
The proposed delivery scheme, based on the scheme proposed by Gatzianas et al., exploits the receiver side information established during the placement phase, and the role of state feedback is found useful especially when the erasure probability is large and/or the normalized memory size is small.
Achieving joint secrecy with cache-channel coding over erasure broadcast channels
We derive upper and lower bounds on the secure capacity-memory tradeoff of the K-user (K > 2) wiretap erasure broadcast channel where Kw receivers are weak and have cache memories of equal size, and
Cache-enabled erasure broadcast channels with feedback: asymmetric user memory case
TLDR
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, shows that the cache network with asymmetric memory sizes might achieve better sum rate performance than the network with symmetricMemory sizes.
Coded caching for wiretap broadcast channels
TLDR
Study of the wiretap erasure broadcast channel with an external eavesdropper when the legitimate receivers have cache memories concludes that under a total cache budget it is often beneficial to assign the cache memories unequally between strong and weak receivers.
...
...

References

SHOWING 1-10 OF 18 REFERENCES
The Performance Analysis of Coded Cache in Wireless Fading Channel
TLDR
This paper employs the coded caching scheme in time division and frequency division transmission mode and forms the sub-optimal problems and results show that the throughput of the technique in wireless scenario will be limited and would decrease as the number of users becomes sufficiently large.
Slepian-Wolf coding over broadcast channels
  • E. Tuncel
  • Computer Science
    IEEE Transactions on Information Theory
  • 2006
TLDR
It is shown with an example that an optimal joint source-channel coding strategy is strictly advantageous over the combination of stand-alone source and channel codes, and thus "informational separation" does not hold.
Improved lower bounds for coded caching
TLDR
This work derives tighter lower bounds on coded caching rates than were known previously and demonstrates that this problem can equivalently be posed as one of optimally labeling the leaves of a directed tree.
Coded Caching With Nonuniform Demands
TLDR
A fundamentally different approach is needed, in which the cache contents are used as side information for coded communication over the shared link, and it is proposed and proved that it is close to optimal.
Hierarchical coded caching
TLDR
A new caching scheme that combines two basic approaches is proposed that achieves the optimal communication rates to within a constant multiplicative and additive gap and shows that there is no tension between the rates in each of the two layers up to the aforementioned gap.
Information-Theoretic Caching: Sequential Coding for Computing
TLDR
It is shown through a two-user example that the two caching models behave differently in general, and it is shown that the optimal caching strategy is closely related to total correlation and Wyner's common information.
Content caching and delivery over heterogeneous wireless networks
TLDR
A coded caching scheme for non-uniform content popularity that dynamically allocates user access to APs based on requested content is designed, demonstrating the approximate optimality of the scheme with respect to information-theoretic bounds and suggesting the intriguing possibility that, to gain most of the benefits of coded caching, it suffices to divide the content into a small number of popularity classes.
Decentralized coded caching attains order-optimal memory-rate tradeoff
  • M. Maddah-Ali, Urs Niesen
  • Computer Science
    2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2013
TLDR
This paper proposes an efficient caching scheme, in which the content placement is performed in a decentralized manner, and hence achieves a rate close to the centralized scheme.
Exploiting the unexploited of coded caching for wireless content distribution
TLDR
A theoretical model to minimize the average wireless traffic volume required in the coded caching, for which the optimized caching distribution is derived with the content popularity distribution taken into account and theoretically shows the order optimality of the results derived from the model.
Online Coded Caching
TLDR
This work proposes an online coded caching scheme termed coded least-recently sent (LRS) and simulates it for a demand time series derived from the dataset made available by Netflix for the Netflix Prize, showing that the proposed coded LRS algorithm significantly outperforms the popular least- recently used caching algorithm.
...
...