一种基于纠删码的分布式存储容灾的设计与实现

在广域的文件存储系统中，每一个节点的可用性是至关重要的，这就需要在该系统中引入一定的冗余来提高每个存储节点的可用性以对存储的数据起到保护的作用。传统的冗余方式是完全复制，但随着副本个数的增加，该机制在存储空间上的浪费暴露无遗，而且在一定程度上这对整个系统性能的提高几乎没有帮助。本丈提出一种基于纠删码的分布式网络容灾模型，在空间冗余度和性能上均优于传统的存储模型。

Design and implementation of a distributed disaster-tolerant system based on erasure code

In a wide-area file storage system, availability of every node is one of the most properties, it needs to provide the right amount of redundancy in their storage scheme to protect data. Thus, some systems use replication to guard against data loss. Unfortunately, as the number of copies increases, replication becomes costly and contributes relatively little to the overall system reliability paper presents the design of a new distributed disaster-tolerant system based on erasure code, which is more efficient in terms of both space and performance than the conventional storage system..