• Corpus ID: 844770

Locally Repairable Regenerating Code Constructions

@article{Ahmad2016LocallyRR,
  title={Locally Repairable Regenerating Code Constructions},
  author={Imad Ahmad and Chih-Chun Wang},
  journal={ArXiv},
  year={2016},
  volume={abs/1605.00020}
}
In this work, we give locally repairable regenerating code (LRRC) [1]-[3], [5], [6] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidth-regenerating (MBR) point. 
View PDF on arXiv
1 Citations
Background Citations
1

One Citation

Citation Type

Citation Type

Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair
TLDR
It is proved that with node unavailability, all existing methods of helper selection, including those used in RCs and LRCs, can be insufficient in terms of achieving the optimal repair-bandwidth.

References

SHOWING 1-10 OF 15 REFERENCES
When locally repairable codes meet regenerating codes — What if some helpers are unavailable
TLDR
It is proved, for the first time in the literature, that with node unavailability, all existing methods of helper selection, including those used in RCs and LRCs, are strictly repair-BW suboptimal.
Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair
TLDR
It is proved that with node unavailability, all existing methods of helper selection, including those used in RCs and LRCs, can be insufficient in terms of achieving the optimal repair-bandwidth.
When Can Helper Node Selection Improve Regenerating Codes? Part II: An Explicit Exact-Repair Code Construction
TLDR
This work provides an exact-repair code construction that attains the minimum-bandwidth-regenerating (MBR) point of FHS, previously calculated/predicted only by the min-cut analysis in Part I.
When and by how much can helper node selection improve regenerating codes?
  • Imad Ahmad, Chih-Chun Wang
  • Computer Science
    2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
Regenerating codes (RCs) can significantly reduce the repair bandwidth of distributed storage networks. Initially, the analysis of RCs was based on the assumption that during the repair process, the…
When Can Helper Node Selection Improve Regenerating Codes? Part I: Graph-Based Analysis
TLDR
A low-complexity helper selection solution, termed the family helper selection (FHS) scheme, is proposed and the corresponding storage/repair-bandwidth curve is characterized and it is proved that under some design parameters, the FHS scheme is indeed optimal among all helper selection schemes.
Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
TLDR
This paper first investigates security in the presence of colluding eavesdroppers, and develops locally repairable coding schemes for DSS that are secure against eavesdropper.
Existence and construction of capacity-achieving network codes for distributed storage
  • Yunnan Wu
  • Computer Science
    2009 IEEE International Symposium on Information Theory
  • 2009
TLDR
It is shown in this paper that optimal codes can be constructed over a finite field whose size depends only on the maximum number of nodes at any instant, but independent of how many failures/repairs can happen.
On the minimum storage overhead of distributed storage codes with a given repair locality
  • H. Hollmann
  • Computer Science
    2014 IEEE International Symposium on Information Theory
  • 2014
TLDR
Some new information theoretical lower bounds on the storage overhead as a function of the repair locality are presented, valid for most common coding and repair models.
Codes With Local Regeneration and Erasure Correction
TLDR
An upper bound on the minimum distance of vector-alphabet codes with locality is derived for the case when their constituent local codes have a certain uniform rank accumulation property.
An algebraic approach to network coding
TLDR
For the multicast setup it is proved that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question.
...
...