Computer Science – Information Theory
Scientific paper
2011-08-19
Computer Science
Information Theory
Submitted to INFOCOM 2012 on 28 July 2011
Scientific paper
Due to the use of commodity software and hardware, crash-stop and Byzantine failures are likely to be more prevalent in today's large-scale distributed storage systems. Regenerating codes have been shown to be a more efficient way to disperse information across multiple nodes and recover crash-stop failures in the literature. In this paper, we present the design of regeneration codes in conjunction with integrity check that allows exact regeneration of failed nodes and data reconstruction in presence of Byzantine failures. A progressive decoding mechanism is incorporated in both procedures to leverage computation performed thus far. The fault-tolerance and security properties of the schemes are also analyzed.
Han Yunghsiang S.
Mow Wai Ho
Zheng Rong
No associations
LandOfFree
Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Storage does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Storage, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Storage will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-107820