Erasure Coding for Decentralized Coded Caching

Reisizadeh, Hadi; Maddah-Ali, Mohammad Ali; Mohajer, Soheil

doi:10.1109/isit.2018.8437574

Cited by 11 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of maximum distance separable (MDS) codes in coded caching was studied in [9]- [12]. MDS codes can provide redundant packets to reduce the transmission load in caching networks.…”

Section: Introductionmentioning

confidence: 99%

“…In [10], the authors investigated the employment of MDS codes in constructing coded multicasting messages for requests on the same file and different files. In [11] and [12], an MDS codes based decentralized coded caching was proposed, where the server first encodes each file by MDS codes and then performs random placement and delivery on the MDS coded files.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

MDS Codes Based Group Coded Caching in Fog Radio Access Networks

Tan¹,

Jiang²,

Zheng³

et al. 2022

Preprint

View full text Add to dashboard Cite

In this paper, we investigate maximum distance separable (MDS) codes based group coded caching in fog radio access networks (F-RANs). The goal is to minimize the average fronthaul rate under nonuniform file popularity. Firstly, an MDS codes and file grouping based coded placement scheme is proposed to provide coded packets and allocate more cache to the most popular files simultaneously. Next, a fog access point (F-AP) grouping based coded delivery scheme is proposed to meet the requests for files from different groups. Furthermore, a closedform expression of the average fronthaul rate is derived. Finally, the parameters related to the proposed coded caching scheme are optimized to fully utilize the gains brought by MDS codes and file grouping. Simulation results show that our proposed scheme obtains significant performance improvement over several existing caching schemes in terms of fronthaul rate reduction.

show abstract

“…The use of maximum distance separable (MDS) codes in coded caching was studied in [9]- [12]. MDS codes can provide redundant packets to reduce the transmission load in caching networks.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

MDS Codes Based Group Coded Caching in Fog Radio Access Networks

Tan¹,

Jiang²,

Zheng³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Caching furthermore facilitates indexcoded broadcasts to multiple users requesting different content, which has been shown to drastically reduce the amount of data that has to be transmitted over the SBS-to-device downlink [7]. ECCs have also been used in conjunction with index coding to ensure data availability at broadcasting devices in D2D caching networks [8] as well as to provide index-coding broadcast opportunities to subsets of users [9], [10]. All these works consider the cached content to be static for a period of time (e.g., a day) according to a given file popularity distribution.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Coded Caching in Wireless Networks

Pedersen

Amat

Brännström

et al. 2021

IEEE Trans. Commun.

View full text Add to dashboard Cite

“…The proposed caching scheme is proved to be order optimal and achieves an additive parallel gain by fully exploiting the opportunity of concurrent transmission at the server and relays. The decentralized content caching and delivery is also widely applied into other contexts, including caching through coded prefetching [26], caching with diverse cache capacities [27], [28], coded caching in the finite file size regime [29], as well as a coded placement based on erasure coding over individual files [30].…”

Section: Introductionmentioning

confidence: 99%

Coded Caching for Broadcast Networks with User Cooperation

Chen¹,

You²,

Wu³

et al. 2020

Preprint

View full text Add to dashboard Cite

We consider cache-aided broadcast networks with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. A new definition of transmission delay is introduced to characterize the latency cost during the delivery phase for arbitrary cache-aided networks. We investigate the deterministic caching and decentralized random caching setups respectively. For the deterministic caching setup, we propose new coded caching scheme that fully exploits time resource by allowing parallel transmission between the server and users. A constant multiplicative gap is derived between the information theoretic lower and upper bounds on the transmission delay. For the decentralized random caching setup, we show that if the cache size of each user is larger than a small threshold that tends to zero as the number of users goes to infinity, then the proposed decentralized coded caching scheme approaches an upper bound with a constant multiplicative factor. For both centralized and decentralized scenarios, we characterize cooperation gain (offered by the cooperation among the users) and parallel gain (offered by the parallel transmission between the server and multiple users) that greatly reduce the transmission delay. Furthermore, we show that due to a tradeoff between the parallel gain, cooperation gain and multicast gain, the number of users who parallelly send information should be chosen dynamically according to the system parameters, and letting more users parallelly send information could cause high transmission delay.

show abstract

Erasure Coding for Decentralized Coded Caching

Cited by 11 publications

References 9 publications

MDS Codes Based Group Coded Caching in Fog Radio Access Networks

MDS Codes Based Group Coded Caching in Fog Radio Access Networks

Dynamic Coded Caching in Wireless Networks

Coded Caching for Broadcast Networks with User Cooperation

Contact Info

Product

Resources

About