RAPID: A Fast Data Update Protocol in Erasure Coded Storage Systems for Big Data

Erasure codes are nowadays used extensively indistributed storage systems that handle big data, since theyoffer significant fault tolerance with low storage overhead. Eventhough erasure coded systems are space efficient, these involvehigher network bandwidth and computational complexity in theiroperations. In this paper, we present RAPID, a protocol for fastdata updates, which works by choosing a subset of code blocksfor updates and adapts the strength of the subset based on thepredicted number of failures. The proposal uses a predictionbased heuristic in which the set of failures that may happen inthe near future is represented as a function of past failures. Ahybrid protocol that uses both locking and buffering mechanismsis adopted in the solution to maintain the consistency on the dataand code blocks updates. Our experimental results demonstrateimprovement in the performance of data updates by 30% andthe failure prediction mechanism proposed shows an accuracy of 80%.