Caching at the Edge with LT Codes

Recayte, Estefania; Lázaro, Francisco; Liva, Gianluigi

doi:10.1109/istc.2018.8625271

Cited by 3 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If n i is large, rateless codes with significantly lower complexity can be used [20]. Such codes have been shown to have close to MDS code performance in distributed caching scenarios [21]. In this work, we will assume that µ i,j ∈ R for simplicity.…”

Section: A Caching Policymentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Coded Caching in Wireless Networks

Pedersen

Amat

Brännström

et al. 2021

IEEE Trans. Commun.

View full text Add to dashboard Cite

Section: A Caching Policymentioning

confidence: 99%

“…For proving that static caching minimizes (22) (and hence (18)) it is sufficient to show that it maximizesR SBS (see (21)), as for static caching R C = 0. Maximizing (21) under constraints (5), (6), (19), and (20), is equivalent to…”

Section: Appendix D Proof Of Theoremmentioning

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

“…MDS caching schemes have been studied in wireless networks to minimize the expected download time [3] or to reduce the amount of data to be sent [4]. Recently, practical caching schemes based on linear random codes in [5] and based on LT codes in [6] have also been proposed.…”

Section: Introductionmentioning

confidence: 99%

Edge Caching: On the Performance of Placement and Delivery Coding Schemes

Recayte

2023

IEEE Trans. Commun.

View full text Add to dashboard Cite

We study the performance of caching schemes based on two different coding techniques. A heterogeneous network is assumed, in which cache-aided relays are connected through a backhaul link to a master node while no connection exits between users and the master node. The first caching scheme considers to fill the cache with encoded content while the second scheme considers to encode the content during the delivery phase. We compare the schemes by characterizing the average transmission load when users ask for downloading content to the network. We provide an approximation of the expression of the average load which allows a fast evaluation of the network behavior for each scheme considered. We further assume a constraint on the capacity of the backhaul link and derive the expression of the outage probability, i.e. the probability that the system is not able to serve the entire set of users demands. Finally, we examine and discuss how the derived analysis of a two relays scenario can be scaled to study the performance of a network with a generic number of relays.

show abstract

Coded Load Balancing in Cache Networks

Siavoshani

Parvaresh

Pourmiri

et al. 2020

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

We consider a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Each incoming content request, arriving uniformly at random to these servers, will be redirected to one or more responsible servers for that request. While assigning each request to its nearest available replica seems to be a reasonable solution, specifically in terms of communication cost, it will result in overloaded servers. Thus, alternatively, we investigate a coded scheme which will address this problem. In this scheme, coded chunks of original files are stored in servers based on the files popularity distribution, which we consider to be Zipf. Then, upon each request arrival, by delivering enough coded chunks to the request origin, the request can be decoded.Specifically, we show that if n requests are assigned to n servers based on the proposed coded scheme, the maximum load of servers will be Θ(1), while in the nearest replica strategy the maximum load is Θ(log n). More surprisingly, this coded scheme will have the same communication cost performance as the nearest replica strategy, asymptotically. Finally, our numerical results show that the coded scheme surpasses the uncoded one even in non-asymptotic regimes.

show abstract

Caching at the Edge with LT Codes

Cited by 3 publications

References 11 publications

Dynamic Coded Caching in Wireless Networks

Dynamic Coded Caching in Wireless Networks

Edge Caching: On the Performance of Placement and Delivery Coding Schemes

Coded Load Balancing in Cache Networks

Contact Info

Product

Resources

About