.png){kind=icon}
.png){kind=icon}
Return
An Outer Bound for Linear Multi-Node Exact Repair Regenerating Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.2996622.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In distributed storage, erasure codes provide fault-tolerance while reducing the storage overhead compared to replication. The network traffic cost during the repair of node failures, called repair bandwidth, is an important metric in code design. Regenerating codes are a class of erasure codes developed with the aim of reducing the repair bandwidth while maintaining a high level of fault-tolerance. They exhibit a tradeoff between the storage overhead per node and the repair bandwidth. However, a fundamental understanding of the storage-repair bandwidth tradeoff under exact repair is open in general. In this work, we consider the exact repair problem of multiple failures in a centralized way. Building upon techniques from the literature, we first provide an alternative proof of the functional repair bound. Then, we derive a new outer bound for linear centralized multi-node exact repair codes and illustrate its performance under various parameter settings. The derived outer bound shows that, in general, the centralized multi-node functional repair tradeoff is not achievable under linear exact repair.
Keywords:
Maintenance engineering
Bandwidth
Spread spectrum communication
Encoding
Solids
Measurement
Fault tolerance
Regenerating codes
multiples erasures
exact repair
outer bounds
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
