Repairing multiple failures adaptively with erasure codes in distributed storage systems

2015 ◽  
Vol 28 (5) ◽  
pp. 1437-1461 ◽  
Author(s):  
Xiaoqiang Pei ◽  
Yijie Wang ◽  
Xingkong Ma ◽  
Fangliang Xu
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Erasure Codes ◽  
Multiple Failures ◽  
Distributed Storage Systems

AN EXPLORATION OF NON-ASYMPTOTIC LOW-DENSITY, PARITY CHECK ERASURE CODES FOR WIDE-AREA STORAGE APPLICATIONS

2007 ◽  
Vol 17 (01) ◽  
pp. 103-123 ◽  
Author(s):  
JAMES S. PLANK ◽  
MICHAEL G. THOMASON
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Ldpc Codes ◽  
Peer To Peer ◽  
Erasure Codes ◽  
Low Density ◽  
Parity Check ◽  
Finite Systems ◽  
Low Density Parity Check ◽  
Distributed Storage Systems

As peer-to-peer and widely distributed storage systems proliferate, the need to perform efficient erasure coding, instead of replication, is crucial to performance and efficiency. Low-Density Parity-Check (LDPC) codes have arisen as alternatives to standard erasure codes, such as Reed-Solomon codes, trading off vastly improved decoding performance for inefficiencies in the amount of data that must be acquired to perform decoding. The scores of papers written on LDPC codes typically analyze their collective and asymptotic behavior. Unfortunately, their practical application requires the generation and analysis of individual codes for finite systems. This paper attempts to illuminate the practical considerations of LDPC codes for peer-to-peer and distributed storage systems. The three main types of LDPC codes are detailed, and a huge variety of codes are generated, then analyzed using simulation. This analysis focuses on the performance of individual codes for finite systems, and addresses several important heretofore unanswered questions about employing LDPC codes in real-world systems.

Cyclic Structure in Regenerating Codes

2014 ◽  
Vol 539 ◽  
pp. 416-419
Author(s):  
Wen Juan Liang ◽  
Ying Du
Keyword(s):  
Storage Systems ◽  
Distributed Storage ◽  
Erasure Codes ◽  
Cyclic Structure ◽  
Distributed Storage Systems ◽  
Regenerating Codes ◽  
Original Message

Regenerating codes are a class of erasure codes for distributed storage. The use of regenerating codes not only improves reliability of distributed storage systems, but also minimizes repairing bandwidth when storage nodes failed and need to be repaired. In this paper, we investigate the cyclic structure of hybrid regenerating codes which each node has two fragments with the first fragment stores original message and the second fragment stores parity message. A fast repairing algorithm is also proposed.

Sign in / Sign up

Export Citation Format

Share Document