Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources

06/19/2018
by   Parisa Hassanzadeh, et al.
0

This paper studies the fundamental limits of content delivery in a cache-aided broadcast network for correlated content generated by a discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. A class of achievable correlation-aware schemes based on a two-step source coding approach is proposed. Library files are first compressed, and then cached and delivered using a combination of correlation-unaware multiple-request cache-aided coded multicast schemes. The first step uses Gray-Wyner source coding to represent the library via private descriptions and descriptions that are common to more than one file. The second step then becomes a multiple-request caching problem, where the demand structure is dictated by the configuration of the compressed library, and it is interesting in its own right. The performance of the proposed two-step scheme is evaluated by comparing its achievable rate with a lower bound on the optimal peak and average rate-memory tradeoffs in a two-file multiple-receiver network, and in a three-file two-receiver network. Specifically, in a network with two files and two receivers, the achievable rate matches the lower bound for a significant memory regime and it is within half of the conditional entropy of files for all other memory values. In the three-file two-receiver network, the two-step strategy achieves the lower bound for large cache capacities, and it is within half of the joint entropy of two of the sources conditioned on the third one for all other cache sizes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2017

Broadcast Caching Networks with Two Receivers and Multiple Correlated Sources

The correlation among the content distributed across a cache-aided broad...
research
08/07/2018

The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II

This paper introduces the notion of cache-tapping into the information t...
research
06/12/2018

On Coding for Cache-Aided Delivery of Dynamic Correlated Content

Cache-aided coded multicast leverages side information at wireless edge ...
research
06/26/2018

On the Capacity Region of a Cache-Aided Gaussian Broadcast Channel with Multi-Layer Messages

A cache-aided K-user Gaussian broadcast channel (BC) is studied. The tra...
research
12/06/2018

A Converse Bound for Cache-Aided Interference Networks

In this paper, an interference network with arbitrary number of transmit...
research
08/17/2023

Rapidgzip: Parallel Decompression and Seeking in Gzip Files Using Cache Prefetching

Gzip is a file compression format, which is ubiquitously used. Although ...
research
01/31/2019

Cache-aided Interference Management Using Hypercube Combinatorial Cache Designs

We consider a cache-aided interference network which consists of a libra...

Please sign up or login with your details

Forgot password? Click here to reset