Storage-Repair Bandwidth Trade-off for Wireless Caching with Partial Failure and Broadcast Repair

Mital, Nitish; Kralevska, Katina; Ling, Cong; Gündüz, Deniz

doi:10.1109/itw.2018.8613401

Cited by 6 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…675891), and UK EPSRC (EP/T023600/1) under the CHIST-ERA program (CHISTERA-18-SDCDN-001). This work has been partly presented in two conference versions [1], [2] less network edge, is attracting a lot of attention in recent years as a promising method to alleviate the increasing traffic on the backhaul links of wireless access points, and to improve the quality of service for end users, particularly by reducing the latency [3], [4], or the energy consumption [5], [6]. The literature on distributed caching systems focuses mostly on the code design or the resource allocation for efficient storage of popular contents, assuming reliable cache nodes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Functional Broadcast Repair of Multiple Partial Failures in Wireless Distributed Storage Systems

Mital¹,

Kralevska²,

Ling³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

We consider a distributed storage system with n nodes, where a user can recover the stored file from any k nodes, and study the problem of repairing r partially failed nodes. We consider broadcast repair, that is, d surviving nodes transmit broadcast messages on an errorfree wireless channel to the r nodes being repaired, which are then used, together with the surviving data in the local memories of the failed nodes, to recover the lost content. First, we derive the trade-off between the storage capacity and the repair bandwidth for partial repair of multiple failed nodes, based on the cut-set bound for information flow graphs. It is shown that utilizing the broadcast nature of the wireless medium and the surviving contents at the partially failed nodes reduces the repair bandwidth per node significantly. Then, we list a set of invariant conditions that are sufficient for a functional repair code to be feasible. We further propose a scheme for functional repair of multiple failed nodes that satisfies the invariant conditions with high probability, and its extension to the repair of partial failures. The performance of the proposed scheme meets the cut-set bound on all the points on the trade-off curve for all admissible parameters when k is divisible by r, while employing linear subpacketization, which is an important practical consideration in the design of distributed storage codes. Unlike random linear codes, which are conventionally used for functional repair of failed nodes, the proposed repair scheme has lower overhead, lower input-output cost, and lower computational complexity during repair.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Maximum distance separable (MDS) codes are typically used for distributed caching of contents at multiple access points [2]- [4]. MDS codes provide flexibility for storage so that users with different connectivity or mobility patterns can download a file from only a subset of the access points.…”

Section: Introductionmentioning

confidence: 99%

Functional Broadcast Repair of Multiple Partial Failures in Wireless Distributed Storage Systems

Mital¹,

Kralevska²,

Ling³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In summary, we will study the broadcast repair of multiple failed cache nodes. The storage-repair bandwidth trade-off for the repair of multiple fully failed nodes is investigated in [9], [10].…”

Section: Introductionmentioning

confidence: 99%

Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes

Mital

Kralevska

Ling

et al. 2019

2019 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

A code construction and repair scheme for optimal functional regeneration of multiple node failures is presented, which is based on stitching together short MDS codes on carefully chosen sets of points lying on a linearized polynomial. The nodes are connected wirelessly, hence all transmissions by helper nodes during a repair round are available to all the nodes being repaired. The scheme is simple and practical because of low subpacketization, low I/O cost and low computational cost. Achievability of the minimum-bandwidth regenerating (MBR) point, as well as an interior point, on the optimal storage-repair bandwidth tradeoff curve is shown. The subspace properties derived in the paper provide insight into the general properties of functional regenerating codes.

show abstract

A cost-efficient hybrid redundancy coding scheme for wireless storage systems

Zhou

et al. 2023

Computer Communications

View full text Add to dashboard Cite

Storage-Repair Bandwidth Trade-off for Wireless Caching with Partial Failure and Broadcast Repair

Cited by 6 publications

References 14 publications

Functional Broadcast Repair of Multiple Partial Failures in Wireless Distributed Storage Systems

Functional Broadcast Repair of Multiple Partial Failures in Wireless Distributed Storage Systems

Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes

A cost-efficient hybrid redundancy coding scheme for wireless storage systems

Contact Info

Product

Resources

About