An efficient multiple-groupcast coded multicasting scheme for finite fractional caching

Ji, Mingyue; Shanmugam, Karthikeyan; Vettigli, Giuseppe; Llorca, Jaime; Tulino, Antonia M.; Caire, Giuseppe

doi:10.1109/icc.2015.7248916

Cited by 41 publications

(49 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We further show that the exponential complexity in the number K of users is inevitable for any algorithm with good approximation ratio for the optimal clique cover delivery problem. In terms of performance, we show that SACM algorithm provides (1 + log K)-approximation 2 which is significantly better than the linear (in K) approximation ratio of the existing coded delivery schemes of [2]- [6], [15], [16]. Furthermore, numerical simulations show that our proposed algorithm provides a considerable bandwidth reduction over the existing coded delivery schemes of [2]- [6], [15], [16] for almost all content placement schemes.…”

Section: A Our Contributionmentioning

confidence: 87%

“…It has been shown that coded caching can significantly reduce the communication bandwidth requirement for satisfying the users' requests. Since then, design and analysis of caching techniques for various kinds of networks have been researched extensively [4]- [15]. Most existing works assume that the users follow the prescriptions made by the system for the content placement.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Approximation Algorithm for Optimal Clique Cover Delivery in Coded Caching

Asghari

Ouyang²,

Nayyar

et al. 2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

Coded caching can significantly reduce the communication bandwidth requirement for satisfying users' demands by utilizing the multicasting gain among multiple users. Most existing works assume that the users follow the prescriptions for content placement made by the system. However, users may prefer to decide what files to cache. To address this issue, we consider a network consisting of a file server connected through a shared link to K users, each equipped with a cache which has been already filled arbitrarily. Given an arbitrary content placement, the goal is to find a delivery strategy for the server that minimizes the load of the shared link. In this paper, we focus on a specific class of coded multicasting delivery schemes known as the "clique cover delivery scheme". We first formulate the optimal clique cover delivery problem as a combinatorial optimization problem. Using a connection with the weighted set cover problem, we propose an approximation algorithm and show that it provides an approximation ratio of (1 + log K), while the approximation ratio for the existing coded delivery schemes is linear in K. Numerical simulations show that our proposed algorithm provides a considerable bandwidth reduction over the existing coded delivery schemes for almost all content placement schemes.

show abstract

Section: A Our Contributionmentioning

confidence: 87%

Section: Introductionmentioning

confidence: 99%

An Approximation Algorithm for Optimal Clique Cover Delivery in Coded Caching

Asghari

Ouyang²,

Nayyar

et al. 2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…andR GW-M R (M ), given in Theorems 9 and 10, with: i) Correlation-Unaware CACM, which refers to the best known CACM scheme proposed for independent files (a combination of [28] and [29] for peak rate, and [29] for average rate), ii) MR Lower Bound, which refers to the lower bound on the MR rate-memory functions R * M R (M, ) andR * M R (M, ), given in Theorem 2, for the operating point of the proposed GW-MR scheme, i.e., the that minimizes R M R (M, ) andR M R (M, ) (see (16) and (17)), and iii) Optimal Lower Bound, which refers to the lower bound on the optimal rate-memory functions R LB (M ) andR LB (M ), given in Theorem 8.…”

Section: A Two-file Networkmentioning

confidence: 99%

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

Hassanzadeh

Tulino

Llorca

et al. 2020

IEEE Trans. Inform. Theory

Self Cite

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

“…In the following we introduce a CACM scheme that is specifically designed for such structures of the demand. Multiple-request schemes in the literature, such as the ones in [13], [14], in addition to applying to settings with equal-length files are designed for arbitrary demands, and therefore, result in higher load over the shared link.…”

Section: Multiple-request Cacmmentioning

confidence: 99%

Broadcast caching networks with two receivers and multiple correlated sources

Hassanzadeh

Tulino

Llorca

et al. 2017

2017 51st Asilomar Conference on Signals, Systems, and Computers

Self Cite

View full text Add to dashboard Cite

The correlation among the content distributed across a cache-aided broadcast network can be exploited to reduce the delivery load on the shared wireless link. This paper considers a two-user three-file network with correlated content, and studies its fundamental limits for the worst-case demand. A class of achievable schemes based on a two-step source coding approach is proposed. Library files are first compressed using Gray-Wyner source coding, and then cached and delivered using a combination of correlation-unaware cache-aided coded multicast schemes. The second step is interesting in its own right and considers a multiple-request caching problem, whose solution requires coding in the placement phase. A lower bound on the optimal peak rate-memory trade-off is derived, which is used to evaluate the performance of the proposed scheme. It is shown that for symmetric sources 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 source for all other cache sizes.

show abstract

An efficient multiple-groupcast coded multicasting scheme for finite fractional caching

Cited by 41 publications

References 17 publications

An Approximation Algorithm for Optimal Clique Cover Delivery in Coded Caching

An Approximation Algorithm for Optimal Clique Cover Delivery in Coded Caching

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

Broadcast caching networks with two receivers and multiple correlated sources

Contact Info

Product

Resources

About