Application of Regenerating Codes for Fault Tolerance in Distributed Storage Systems

被引:1
作者
Peter, Kathrin [1 ]
Sobe, Peter [2 ]
机构
[1] Humboldt Univ, Berlin, Germany
[2] HTW, Dresden, Germany
来源
2012 11TH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA) | 2012年
关键词
Erasure coding; Distributed Storage Systems;
D O I
10.1109/NCA.2012.35
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Recently, regenerating codes, a special network coding technique, were discovered for fault-tolerant storage systems with the promising advantage of efficient data recovery in the case of a single node failure and replacement (regeneration case). From the perspective of coding theory, regenerating codes are extensively studied, but there exists no reference on how to implement these codes in storage systems. We provide a comparison of Reed-Solomon codes and regenerating codes from an implementation point of view. The comparison includes the experimental evaluation of the encoding and the regeneration data throughput.
引用
收藏
页码:67 / 70
页数:4
相关论文
共 7 条
  • [1] Dimakis A. G., 2010, ABS10044438 CORR
  • [2] Duminuco A., 2009, ICDCS 09
  • [3] Patterson D. A., 1988, ACM SIGMOD RECORD, V17, P109
  • [4] Plank JS, 1997, SOFTWARE PRACT EXPER, V27, P995, DOI 10.1002/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.0.CO
  • [5] 2-6
  • [6] Rashmi K. V., 2010, ABS10054178 CORR
  • [7] POLYNOMIAL CODES OVER CERTAIN FINITE FIELDS
    REED, IS
    SOLOMON, G
    [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (02): : 300 - 304