Cache-aided coded multicast for correlated sources

Hassanzadeh, Parisa; Tulino, Antonia M.; Llorca, Jaime; Erkip, Elza

doi:10.1109/istc.2016.7593137

Cited by 25 publications

(27 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We upper bound the rate achieved with Algorithm GGC 1 , as in Appendix A, by upper bounding the rate of the coded multicast segment with (20). Then, for a given receiver label of size , for example label K , and a given root node v r in the augmented graph:…”

Section: Appendix C Proof Of Theoremmentioning

confidence: 99%

See 1 more Smart Citation

On Coding for Cache-Aided Delivery of Dynamic Correlated Content

Hassanzadeh

Tulino

Llorca

et al. 2018

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Cache-aided coded multicast leverages side information at wireless edge caches to efficiently serve multiple unicast demands via common multicast transmissions, leading to load reductions that are proportional to the aggregate cache size. However, the increasingly dynamic, unpredictable, and personalized nature of the content that users consume challenges the efficiency of existing caching-based solutions in which only exact content reuse is explored. This paper generalizes the cache-aided coded multicast problem to specifically account for the correlation among content files, such as, for example, the one between updated versions of dynamic data. It is shown that (i) caching content pieces based on their correlation with the rest of the library, and (ii) jointly compressing requested files using cached information as references during delivery, can provide load reductions that go beyond those achieved with existing schemes. This is accomplished via the design of a class of correlationaware achievable schemes, shown to significantly outperform state-of-the-art correlation-unaware solutions. Our results show that as we move towards real-time and/or personalized media dominated services, where exact cache hits are almost non-existent but updates can exhibit high levels of correlation, network cached information can still be useful as references for network compression.

show abstract

Section: Appendix C Proof Of Theoremmentioning

confidence: 99%

“…Combining all these events, and from (38), group G vr is assigned to an independent set associated with K with probability P 1 K is associated to G vr = 1 Then from (20), it follows that…”

Section: Appendix C Proof Of Theoremmentioning

confidence: 99%

On Coding for Cache-Aided Delivery of Dynamic Correlated Content

Hassanzadeh

Tulino

Llorca

et al. 2018

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…Our prior works in [7]- [9] focus on lossless reconstruction in a setting with an arbitrary number of files and receivers that allows exploring untapped global caching gains under correlated sources. A correlation-aware scheme is proposed in [7] and [8], in which content is cached according to both the popularity of files and their correlation with the rest of the library. Cached information is then used as references for this class of schemes, and comparing it with a lower bound on the optimal rate-memory trade-offs derived in [19] using a cut-set argument on the corresponding cache-demand augmented graph [20].…”

Section: Introductionmentioning

confidence: 99%

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

Hassanzadeh

Tulino

Llorca

et al. 2020

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

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.for the compression of requested files during the delivery phase. Alternatively, our work in [9] addresses the content dependency by first compressing the correlated library. A subset of the files, most representative of the library, are selected as references, referred to as I-files, and the remaining files are inter-compressed with respect to the selected files and referred to as P-files.This results in a compressed library where each file is made up of an I-file and a P-file, leading to a multiple-request caching problem. Differently from previous multiple-request schemes [4],[15]- [18], the demand in [9] has a specific structure dictated by the configuration of the resulting compressed library in terms of I-files and P-files. 3 The first information-theoretic characterization of the rate-memory trade-off in a cache-aided broadcast network with correlated content was studied in [10] for the setting of two files and two receivers, each equipped with a cache. This paper introduces an achievable two-step scheme that exploits content correlations by first jointly compressing the library files using the Gray-Wyner network [14], and then treating the compressed content as independent files. It is shown in [10] that this strategy is optimal for a large memory regime, while the gap to optimality is quantified for other memory values.Building on the idea introduced in [9] and [10], concurrent work i...

show abstract

“…Caching for content distribution in networks is an active area of research with several works studying the cache placement and delivery protocols [9], [10], [11], [12], [13], [14]. In the traditional caching settings, users are often interested in a specific subset of the popular files.…”

Section: Introductionmentioning

confidence: 99%

Updating Content in Cache-Aided Coded Multicast

Mahdian

Prakash

Médard

et al. 2018

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study a single source multiple destination network coded multicast problem in a cache-aided network. We focus on models where the caches are primarily located near the destinations, and where the source has no cache. The source observes a sequence of correlated frames, and is expected to do frame-by-frame encoding with no access to prior frames. We present a novel scheme that shows how the caches can be advantageously used to decrease the overall cost of multicast, even though the source encodes without access to past data. Our cache design and update scheme works with any choice of network code designed for a corresponding cache-less network, is largely decentralized, and works for an arbitrary network. We study a convex relation of the optimization problem that results form the overall cost function. The results of the optimization problem determines the rate allocation and caching strategies. Numerous simulation results are presented to substantiate the theory developed.

show abstract

Cache-aided coded multicast for correlated sources

Cited by 25 publications

References 10 publications

On Coding for Cache-Aided Delivery of Dynamic Correlated Content

On Coding for Cache-Aided Delivery of Dynamic Correlated Content

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

Updating Content in Cache-Aided Coded Multicast

Contact Info

Product

Resources

About