Locally Minimum Storage Regenerating Codes in Distributed Cloud Storage Systems
Locally Minimum Storage Regenerating Codes in Distributed Cloud Storage Systems
复制标题
分布式云存储系统中的局部最小存储重新生成代码
DOI：
10.1109/cc.2017.8233653
复制
发表时间：
2017-11-01
影响因子：
4.1
通讯作者：
Dong, Xiaodai
中科院分区：
文献类型：
--
作者：
Wang, Jing;Luo, Wei;Dong, Xiaodai
在分布式云存储系统中，不可避免地存在多个节点同时失效的问题。现有的代码再生方法，包括最小存储再生（MSR）代码和最小带宽再生（MBR）代码，主要是修复单个或多个失效节点，无法满足分布式云存储系统的修复需求。在本文中，我们提出了本地最小存储再生（LMSR）码恢复多个故障节点在同一时间。具体地，将分布式云存储系统中的节点划分为多个局部组，并在每个局部组中构造（4，2）或（5，3）MSR码。研究了存储节点的分组方法和局部组中失效节点的修复过程。理论分析表明，LMSR码可以达到与MSR码相同的存储开销。仿真结果表明，与MSR码相比，LMSR码能有效地降低修复带宽和磁盘I/O开销。
In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating (MSR) codes and minimum bandwidth regenerating (MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating (LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group (4, 2) or (5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.