The data redundancy method for distributed Storage based on erasure code

This paper presents a data redundancy method for distributed storage by applying Erasure code to storage system. The method involves some key technologies such as data read and written, failure detection and node redirection, and restoration algorithms. According to the theoretical analysis, this method can efficiently improve the use ratio of storage space as well as enhance reliability and availability for a storage system. Also, it can obtain the same availability of data at the cost of lower redundancy degree compared with many others storage methods. The quantitative analysis of this method’s performance is also given in the paper.