Cascade Codes for Distributed Storage Systems

  title={Cascade Codes for Distributed Storage Systems},
  author={Mehran Elyasi and Soheil Mohajer},
  journal={IEEE Transactions on Information Theory},
  • M. Elyasi, S. Mohajer
  • Published 3 January 2019
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
A novel coding scheme for exact repair-regenerating codes is presented in this paper. The codes proposed in this work can trade between the repair bandwidth of nodes (number of downloaded symbols from each surviving node in a repair process) and the required storage overhead of the system. These codes work for general system parameters <inline-formula> <tex-math notation="LaTeX">$(n,k,d)$ </tex-math></inline-formula>, which are the total number of nodes, the number of nodes suffice for data… Expand
Exact-Repair Codes With Partial Collaboration in Distributed Storage Systems
The scenario where the number of repairing nodes is greater than that of reconstruction nodes and the storage capacity is already minimal for partial collaboration is considered and an MDS array code is constructed, which asymptotically achieves the MSPCR point. Expand
Multilinear Algebra for Minimum Storage Regenerating Codes
In this work, various ways to re-express the infamous product-matrix construction using skew-symmetric matrices, polynomials, symmetric algebras, and exterior alge bras are explored. Expand
Recovery and Repair Schemes for Shift-XOR Regenerating Codes
Decoding and repair schemes are proposed for shift-exclusive-or (shift-XOR) product-matrix (PM) regenerating codes, which outperform the existing schemes in terms of both communication andExpand
A Generic Transformation for Optimal Node Repair in MDS Array Codes over F2
  • Jie Li, Xiaohu Tang, C. Hollanti
  • Computer Science, Mathematics
  • IEEE Transactions on Communications
  • 2021
This paper proposes another generic transformation that can convert any [n, k] binary MDS array code into a new one, which endows any r = n − k ≥ 2 chosen nodes with optimal repair bandwidth and optimal rebuilding access properties, and at the same time, preserves the normalized repair bandwidth/rebuilding access for the remaining k nodes under some conditions. Expand
Multilinear Algebra for Distributed Storage
This work establishes a multilinear algebra foundation to assemble $(n, k, d, \alpha, \beta, M)$-ERRCs for all meaningful tuples, and ties the $\alpha/M$-versus-$\beta/M $ trade-off with cascade codes, the best known construction for this trade-offs. Expand
Codes for Distributed Storage
This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure, and explains here, how coding theory has evolved to tackle this fresh challenge. Expand
Johnson Graph Codes
A construction and main properties for the codes are given and their role in the concatenation of layered codes that are used in distributed storage systems is shown. Expand
On the data persistency of replicated erasure codes in distributed storage systems
This paper analyzes two strategies of replicated erasure codes distribution: random and symmetric and derives closed analytical and asymptotic formulas for expected data persistency despite nodes failure. Expand
A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth
This paper presents a transformation that can greatly reduce the sub-packetization level of MDS codes with the optimal repair bandwidth with respect to the same code length n, and proposes another explicit MDS code which has a similar structure as that of the first resultant code obtained by the generic transformation, but can be built on a smaller finite field. Expand


Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
An explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, and an ability of the code to perform repair through mere transfer of data as repair by transfer are named. Expand
Product Matrix MSR Codes With Bandwidth Adaptive Exact Repair
This paper introduces a class of MSR codes that realize the optimal repair bandwidth simultaneously with a set of different choices for the number of helpers, namely PM MSR code, which could be considered as a generalization of the product matrix (PM) framework. Expand
A Cascade Code Construction for (n, k, d) Distributed Storage Systems
  • M. Elyasi, S. Mohajer
  • Computer Science, Mathematics
  • 2018 IEEE International Symposium on Information Theory (ISIT)
  • 2018
A novel class of exact-repair regenerating codes is introduced for a distributed storage system with arbitrary parameters, which meets the optimum trade-off at the MBR and MSR points and improves all the previously known bounds for interior points. Expand
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
To the best of the knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. Expand
Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes
It is shown that the proposed codes are optimum, in the sense that any operating point satisfying the lower bound for the storage-bandwidth trade-off can be achieved with the proposed construction. Expand
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
The constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound, and Interference alignment is a theme that runs throughout the paper. Expand
Minimum storage regenerating codes for all parameters
The main result in this paper is an explicit construction of systematic-repair MSR codes of high rate k/n > 0.5 and low repair connectivity k ≤ d ≤ n - 1, not previously known to exist. Expand
Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
A new repair mechanism is proposed for determinant code, which relaxes this dependency, while preserving all other properties of the code, and it is shown that the determinant codes are capable of repairing multiple failures, with a per-node repair-bandwidth which scales sub-linearly with the number of failures. Expand
Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes
This paper considers two simultaneous extensions to the original regenerating codes framework, and provides a more natural extension of the well-known product matrix MBR codes, modified to provide flexibility in choosing the number of helpers in each repair, and simultaneously be robust to erroneous nodes in the network. Expand
Existence and construction of capacity-achieving network codes for distributed storage
  • Yunnan Wu
  • Computer Science
  • 2009 IEEE International Symposium on Information Theory
  • 2009
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. Expand