Erasure coding for distributed storage: an overview

In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of no...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Science China. Information sciences Ročník 61; číslo 10; s. 100301
Hlavní autoři: Balaji, S. B., Krishnan, M. Nikhil, Vajha, Myna, Ramkumar, Vinayak, Sasidharan, Birenjith, Kumar, P. Vijay
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Science China Press 01.10.2018
Springer Nature B.V
Témata:
Bandwidths
Codes
Coding
Coding theory
Computer centers
Computer Science
Information Systems and Communication Service
Nodes
Review
Storage units
codes with locality
erasure codes
node repair
distributed storage
locally recoverable codes
regenerating codes
ISSN:1674-733X, 1869-1919
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolved to handle these challenges by introducing two new classes of erasure codes, namely regenerating codes and locally recoverable codes as well as by coming up with novel ways to repair the ubiquitous Reed-Solomon code. This survey provides an overview of the efforts in this direction that have taken place over the past decade.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-018-9482-6