Practical self-repairing codes for distributed storage

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC) Pub Date : 2012-11-01 DOI:10.1109/APCLOUDCC.2012.6486516

Hanxu Hou, Hui Li

{"title":"Practical self-repairing codes for distributed storage","authors":"Hanxu Hou, Hui Li","doi":"10.1109/APCLOUDCC.2012.6486516","DOIUrl":null,"url":null,"abstract":"In distributed storage systems, projective geometric self-repairing codes (PSRC) are able to provide a repair mechanism, which can repair a failed node with only two nodes. However, the redundancy of PSRC is extremely large, which makes PSRC unpractical for distributed storage systems. In this paper, we propose a new family of self-repairing codes called practical projective geometric self-repairing codes (PPSRC), which is a generalization of PSRC. PPSRC allow tradeoff between the coding rate and self-repairing capacity, while possess the basic property of PSRC. In addition, we provide an evolutionary repairing process for PPSRC, of which the repairing bandwidth is less than both the repairing process in [5] and that of the minimal storage repair codes (MSR) [3]. Furthermore, we present the general reconstruction process of PPSRC and the reconstruction process is optimal in terms of downloading bandwidth. Finally, we demonstrate PPSRC surpass the existing erasure coding strategies in terms of complexity, repairing nodes, repairing bandwidth and self-repairing capacity, which makes the PPSRC very attractive for distributed storage systems.","PeriodicalId":331441,"journal":{"name":"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCLOUDCC.2012.6486516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

Abstract

In distributed storage systems, projective geometric self-repairing codes (PSRC) are able to provide a repair mechanism, which can repair a failed node with only two nodes. However, the redundancy of PSRC is extremely large, which makes PSRC unpractical for distributed storage systems. In this paper, we propose a new family of self-repairing codes called practical projective geometric self-repairing codes (PPSRC), which is a generalization of PSRC. PPSRC allow tradeoff between the coding rate and self-repairing capacity, while possess the basic property of PSRC. In addition, we provide an evolutionary repairing process for PPSRC, of which the repairing bandwidth is less than both the repairing process in [5] and that of the minimal storage repair codes (MSR) [3]. Furthermore, we present the general reconstruction process of PPSRC and the reconstruction process is optimal in terms of downloading bandwidth. Finally, we demonstrate PPSRC surpass the existing erasure coding strategies in terms of complexity, repairing nodes, repairing bandwidth and self-repairing capacity, which makes the PPSRC very attractive for distributed storage systems.

查看原文本刊更多论文

用于分布式存储的实用自修复代码

在分布式存储系统中，投影几何自修复码(PSRC)能够提供一种仅用两个节点就能修复故障节点的修复机制。然而，PSRC的冗余度非常大，这使得PSRC在分布式存储系统中不实用。本文提出了一种新的自修复码族，称为实用投影几何自修复码(PPSRC)，它是PSRC的推广。PPSRC可以在编码速率和自修复能力之间进行权衡，同时具有PSRC的基本特性。此外，我们还提出了一种PPSRC的进化修复过程，其修复带宽小于文献[5]和最小存储修复码(MSR)[3]中的修复过程。此外，我们给出了PPSRC的一般重构过程，并且在下载带宽方面重构过程是最优的。最后，我们证明了PPSRC在复杂性、修复节点、修复带宽和自修复能力等方面都超越了现有的擦除编码策略，这使得PPSRC在分布式存储系统中具有很大的吸引力。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2012 IEEE Asia Pacific Cloud Computing Congress (APCloudCC)

自引率

0.00%

发文量