Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes

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

doi:10.1109/isit.2019.8849496

Cited by 3 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our construction uses the geometric view of a linear repair code, and frames the relationship between the local intersection and global independence properties of the subspaces. In the conference publication [1], we presented a code construction achieving the MBR point and an interior point on the optimal storage-repair bandwidth trade-off for full node repair. In this paper, we modify and improve that scheme, and extend it to achieve all the points on the trade-off curve for full node repair as well as partial repair.…”

Section: B Related Workmentioning

confidence: 99%

“…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: B Related Workmentioning

confidence: 99%