CORE: Augmenting regenerating-coding-based recovery for single and concurrent failures in distributed storage systems
Refereed conference paper presented and published in conference proceedings


Times Cited
Altmetrics Information
.

Other information
AbstractData availability is critical in distributed storage systems, especially when node failures are prevalent in real life. A key requirement is to minimize the amount of data transferred among nodes when recovering the lost or unavailable data of failed nodes. This paper explores recovery solutions based on regenerating codes, which are shown to provide fault-tolerant storage and minimum recovery bandwidth. Existing optimal regenerating codes are designed for single node failures. We build a system called CORE, which augments existing optimal regenerating codes to support a general number of failures including single and concurrent failures. We theoretically show that CORE achieves the minimum possible recovery bandwidth for most cases. We implement CORE and evaluate our prototype atop a Hadoop HDFS cluster testbed with up to 20 storage nodes. We demonstrate that our CORE prototype conforms to our theoretical findings and achieves recovery bandwidth saving when compared to the conventional recovery approach based on erasure codes. © 2013 IEEE.
All Author(s) ListLi R., Lin J., Lee P.P.C.
Name of Conference2013 IEEE 29th Symposium on Mass Storage Systems and Technologies, MSST 2013
Start Date of Conference06/05/2013
End Date of Conference10/05/2013
Place of ConferenceLong Beach, CA
Country/Region of ConferenceUnited States of America
Detailed descriptionorganized by IEEE,
Year2013
Month9
Day2
ISBN9781479902170
ISSN2160-1968
LanguagesEnglish-United Kingdom
Keywordscoding theory, distributed storage systems, experiments and implementation, failure recovery, regenerating codes

Last updated on 2020-20-10 at 00:39