Coded Placement for Systems with Shared Caches

Ibrahim, Abdelrahman M.; Zewail, Ahmed A.; Yener, Aylin

doi:10.1109/icc.2019.8761409

Cited by 22 publications

(21 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For comparison, we considered only the scheme in [10] and the optimal scheme (under uncoded placement) in [4]. There are other centralized shared cache schemes in the literature [5], [7]. The scheme in [5] caches both uncoded and coded portions of files by taking into account the association profile.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…There are other centralized shared cache schemes in the literature [5], [7]. The scheme in [5] caches both uncoded and coded portions of files by taking into account the association profile. The association profile, L should be known exactly at the placement phase itself and, the scheme outperforms the optimal scheme in [4] significantly if L is highly skewed.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…Let the user-to-cache association be such that L = (5, 4, 3, 2, 2, 1). Then, construct a (17, 3, 1, [6] × [5]) generalized PDA G as described in Algorithm 1. The array G is given in (8).…”

Section: A Motivating Examplementioning

confidence: 99%

“…For the same user-to-cache association and L considered in the previous case, we get the (17, 3, 1, [6] × [5]) generalized PDA G ′ as given in (9). The sub-packetization level required remains the same but the delivery load is given as…”

Section: A Motivating Examplementioning

confidence: 99%

See 3 more Smart Citations

Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays

Peter¹,

Namboodiri²,

Rajan³

2022

Preprint

View full text Add to dashboard Cite

This work considers the coded caching problem with shared caches, where users share the caches, and each user gets access only to one cache. The user-to-cache association is assumed to be known at the server during the placement phase. We focus on the schemes derived using placement delivery arrays (PDAs). The PDAs were originally designed to address the subpacketization bottleneck of coded caching in a dedicated cache setup. We observe that in the setup of this paper permuting the columns of the PDA results in schemes with different performance for the same problem, but the sub-packetization level remains the same. This is contrary to what was observed for dedicated cache networks. We propose a procedure to identify the ordering of columns that gives the best performance possible for the PDA employed for the given problem. Further, some specific classes of PDAs are chosen and the performance gain achieved by reordering the columns of the PDA is illustrated.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Section: Discussion and Related Workmentioning

confidence: 99%

“…Let the user-to-cache association be such that L = (5, 4, 3, 2, 2, 1). Then, construct a (17, 3, 1, [6] × [5]) generalized PDA G as described in Algorithm 1. The array G is given in (8).…”

Section: A Motivating Examplementioning

confidence: 99%

Section: A Motivating Examplementioning

confidence: 99%

See 2 more Smart Citations

Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays

Peter¹,

Namboodiri²,

Rajan³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…In such cases caching schemes suited for such situations have to be implemented. In the recent years, coded caching schemes for various cache share situations have been studied in the work of [2], [3], [4], [5], [6], [7], [8], [9] etc. In this work, we propose a new construction of a combinatorial structure called cross resolvable designs which was first discussed in [7] and develop multi-access coded caching from it.…”

Section: Introductionmentioning

confidence: 99%

Maddah-Ali-Niesen Scheme for Multi-access Coded Caching

Muralidhar

Katyal

Rajan

2021

2021 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

Multi-access coded caching schemes from cross resolvable designs (CRD) have been reported recently [7]. To be able to compare coded caching schemes with different number of users and possibly with different number of caches a new metric called rate-per-user was introduced and it was shown that under this new metric the schemes from CRDs perform better than the Maddah-Ali-Niesen scheme in the large memory regime. In this paper a new class of CRDs is presented and it is shown that the multi-access coded caching schemes derived from these CRDs perform better than the Maddah-Ali-Niesen scheme in the entire memory regime.

show abstract

Cache-Aided Networks with Shared Caches and Correlated Content under Non-Uniform Demands

Merikhi

Soleymani

2023

2023 IEEE 20th Consumer Communications &Amp; Networking Conference (CCNC)

View full text Add to dashboard Cite

Coded Placement for Systems with Shared Caches

Cited by 22 publications

References 12 publications

Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays

Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays

Maddah-Ali-Niesen Scheme for Multi-access Coded Caching

Cache-Aided Networks with Shared Caches and Correlated Content under Non-Uniform Demands

Contact Info

Product

Resources

About