Hybrid Redundancy Fault Tolerant Codec in Distributed Storage System

Abstract

Reed-Solomon erasure codes is the most widely used multi-binary codes which could correct the random errors and unexpected errors. Its characteristics include: It has the strongest capability to correct random errors and burst errors under the same coding redundancy and larger coding gain under the same coding efficiency, Secondly, it is close to the limit in the case of short codes and medium codes and it can greatly improve the performance of the error correction when it is combined with the data interleaving technology, Finally, it has strict algebraic structure which is shown as the linear cyclic polynomials. This paper develops a new merge approach of nonlinear self-repairing code and Reed-Solomon codes. When the network condition is good, Reed-Solomon erasure codes is adopted, and in poor network conditions, nonlinear self-repairing codes is used. The efficiency of maintaining redundant data is improved by a few of damaged information. The experiments show that this method can reduce the amount of network transmission data, at the same time it can shorten the amount data of recovery operation and reconstruction time.