Reed Solomon codes for Erasure Correction in SDDS
نویسنده
چکیده
Scalable Distributed Data Structures (SDDS) need scalable availability. This can be provided through replication, which is storage intensive, or through the use of Erasure Correcting Codes (ECC) to provide redundancy, which is more complicated. We calculate availability under both strategies and show that redundancy through use of an ECC implies significantly less overhead. We introduce a generalized Reed Solomon code as an ECC that uses ordinary parity (XOR) for the first level of redundancy, and adapts to the scaling up and down of an SDDS file. We derive the relevant properties of the ECC directly and discuss its adaptation to the changing needs of a SDDS.
منابع مشابه
RFC 5510 Reed - Solomon Forward Error Correction April
This document describes a Fully-Specified Forward Error Correction (FEC) Scheme for the Reed-Solomon FEC codes over GF(2^^m), where m is in {2..16}, and its application to the reliable delivery of data objects on the packet erasure channel (i.e., a communication path where packets are either received without any corruption or discarded during transmission). This document also describes a Fully-...
متن کاملWhy Digital Fountain’s Raptor Code Is Better than Reed-solomon Erasure Codes for Streaming Applications
متن کامل
On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes
Network transfer and disk read are the most time consuming operations in the repair process for node failures in erasure-code-based distributed storage systems. Recent developments on Reed-Solomon codes, the most widely used erasure codes in practical storage systems, have shown that efficient repair schemes specifically tailored to these codes can significantly reduce the network bandwidth spe...
متن کاملEfficient Erasure Decoding for Generalized Reed Solomon Codes
We present an efficient erasure decoding algorithm for generalized Reed Solomon codes constructed by utilizing the structure of the inverse of the VanderMonde matrices. Given an [n, k] generalized Reed Solomon code, decoding for r erasures, where r = n − k, requires rk + n Galois field multiplications and r(k − 1) Galois field additions after setting up the decoding structures for an erasure pa...
متن کاملXORing Elephants: Novel Erasure Codes for Big Data
Distributed storage systems for large clusters typically use replication to provide reliability. Recently, erasure codes have been used to reduce the large storage overhead of threereplicated systems. Reed-Solomon codes are the standard design choice and their high repair cost is often considered an unavoidable price to pay for high storage efficiency and high reliability. This paper shows how ...
متن کامل