Date Added: Feb 2013
Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. However, traditional erasure codes are inefficient on reading stored data in degraded environments (when nodes might be unavailable), and on replenishing lost data (vital for long term resilience). Consequently, novel codes optimized to cope with distributed storage system nuances are vigorously being researched. In this paper, the authors take an engineering alternative, exploring the use of simple and mature techniques - juxtaposing a standard erasure code with RAID- 4 like parity.