English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Data availability is critical in distributed storage systems, especially whennode failures are prevalent in real life. A key requirement is to minimize theamount of data transferred among nodes when recovering the lost or unavailabledata of failed nodes. This paper explores recovery solutions based onregenerating codes, which are shown to provide fault-tolerant storage andminimum recovery bandwidth. Existing optimal regenerating codes are designedfor single node failures. We build a system called CORE, which augmentsexisting optimal regenerating codes to support a general number of failuresincluding single and concurrent failures. We theoretically show that COREachieves the minimum possible recovery bandwidth for most cases. We implementCORE and evaluate our prototype atop a Hadoop HDFS cluster testbed with up to20 storage nodes. We demonstrate that our CORE prototype conforms to ourtheoretical findings and achieves recovery bandwidth saving when compared tothe conventional recovery approach based on erasure codes.

CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems