Decentralized Coded Caching for Shared Caches

Dutta, Monolina; Thomas, Anoop

doi:10.1109/lcomm.2021.3052237

Cited by 22 publications

(20 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A caching scheme based on coded placement was proposed in [8], which outperforms the scheme in [5] in certain memory regimes. An optimal decentralized coded caching scheme for shared caches was proposed in [9]. An alternate optimal delivery scheme for the decentralized setting was given in [10].…”

Section: A Related Workmentioning

confidence: 99%

Coded Caching with Shared Caches from Generalized Placement Delivery Arrays

Peter¹,

Rajan²

2021

Preprint

View full text Add to dashboard Cite

We consider the coded caching problem with shared caches where several users share a cache, but each user has access to only a single cache. For this network, the fundamental limits of coded caching are known for centralized and decentralized settings under uncoded placement. In the centralized case, to achieve the gains offered by coded caching, one requires a subpacketization which increases exponentially with the number of caches. The dedicated cache networks had a similar issue, and placement delivery arrays (PDAs) were introduced as a solution to it. Using the PDA framework, we propose a procedure to obtain new coded caching schemes for shared caches with lower sub-packetization requirements. The advantage of this procedure is that we can transform all the existing PDA structures into coded caching schemes for shared caches, thus resulting in low sub-packetization schemes. We also show that the optimal scheme given by Parrinello, Ünsal and Elia (Fundamental Limits of Coded Caching with Multiple Antennas, Shared Caches and Uncoded Prefetching) can be recovered using a Maddah-Ali Niesen PDA.

show abstract

Section: A Related Workmentioning

confidence: 99%

Coded Caching with Shared Caches from Generalized Placement Delivery Arrays

Peter¹,

Rajan²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In [1], Maddah-Alo and Niesen (MAN) presented pioneering information-theoretic research on coded caching, where the network topology was deterministic without user inactivity, inspiring a substantial body of scientific work. Of relevance to this paper are [2], [24], [30], [33]- [36] which consider coded caching either from the perspective of optimization, or with user inactivity, or in a decentralized manner.…”

Section: A Related Workmentioning

confidence: 99%

“…Decentralized coded caching has been investigated based on random cache placement operated independently at each user, which removes the need for central coordination which is not always applicable for practical wireless cellular networks [2], [35], [36]. [2] proposed a framework for decentralized coded caching and analyzed its application in three different typologies: tree topology, shared caches and multiple requests.…”

Section: A Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Fundamental Rate-Memory Tradeoff for Coded Caching in Presence of User Inactivity

Liao,

Tirkkonen

2021

Preprint

View full text Add to dashboard Cite

Coded caching utilizes proper file subpacketization and coded delivery to make full use of the multicast opportunities in content delivery, to alleviate file transfer load in massive content delivery scenarios. Most existing work considers deterministic environments. An important practical topic is to characterize the impact of the uncertainty from user inactivity on coded caching. We consider a one server cache-enabled network under homogeneous file and network settings in presence of user inactivity. Unlike random or probabilistic caching studied in the literature, deterministic coded caching is considered, with the objective to minimize the worst-case backhaul load by optimizing the file subpacketization and the caching strategy. First, a coded caching method is used, where each file is split into the same type of fragments labeled using sets with fixed cardinality, and the optimality of the selected cardinality is proved. Optimal file subpacketization by splitting the file into multiple types of fragments labeled with multiple cardinalities is then discussed. We show that the closed-form optimum turns out to be given by a fixed cardinality-optimizing for user inactivity only affects file delivery, cache placement is not affected. A decentralized version is also discussed and analyzed, where each user fills its storage independently at random without centralized coordination, and user inactivity is taken into account in file delivery. Simulation results show that the optimization based centralized coded caching scheme provides performance comparable to the ideal scenario assuming full knowledge of user inactivity in the placement phase, while decentralized caching performs slightly worse against user inactivity.

show abstract

“…Techniques from index coding are used to obtain a lower bound for the proposed delivery rate. Such techniques were earlier used in [30]- [32] and we extend these techniques to our new model to obtain a lower bound. From our proposed general model the conditions in [8], [22] and [30] are obtained as special cases and their results can be derived.…”

Section: Introductionmentioning

confidence: 99%

Multi-access Coded Caching with Decentralized Prefetching

Dutta¹,

Thomas²,

Rajan³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

An extension of coded caching referred to as multi-access coded caching where each user can access multiple caches and each cache can serve multiple users is considered in this paper. Most of the literature in multi-access coded caching focuses on cyclic wrap-around cache access where each user is allowed to access an exclusive set of consecutive caches only. In this paper, a more general framework of multi-access caching problem is considered in which each user is allowed to randomly connect to a specific number of caches and multiple users can access the same set of caches. For the proposed system model considering decentralized prefetching, a new delivery scheme is proposed and an expression for per user delivery rate is obtained. A lower bound on the delivery rate is derived using techniques from index coding. The proposed scheme is shown to be optimal among all the linear schemes under certain conditions. An improved delivery rate and a lower bound for the decentralized multi-access coded caching scheme with cyclic wrap-around cache access can be obtained as a special case. By giving specific values to certain parameters, the results of decentralized shared caching scheme and of conventional decentralized caching scheme can be recovered.

show abstract

Decentralized Coded Caching for Shared Caches

Cited by 22 publications

References 16 publications

Coded Caching with Shared Caches from Generalized Placement Delivery Arrays

Coded Caching with Shared Caches from Generalized Placement Delivery Arrays

Fundamental Rate-Memory Tradeoff for Coded Caching in Presence of User Inactivity

Multi-access Coded Caching with Decentralized Prefetching

Contact Info

Product

Resources

About