2010
DOI: 10.1109/jsac.2010.100216
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
105
1

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 128 publications
(106 citation statements)
references
References 8 publications
0
105
1
Order By: Relevance
“…On top of regenerating codes, several studies (e.g., [29], [34], [55], [56]) address cooperative recovery for multiple failures. Their idea is to have new nodes exchange reconstructed data to minimize the overall repair traffic.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…On top of regenerating codes, several studies (e.g., [29], [34], [55], [56]) address cooperative recovery for multiple failures. Their idea is to have new nodes exchange reconstructed data to minimize the overall repair traffic.…”
Section: Related Workmentioning
confidence: 99%
“…Regenerating codes have been extensively studied in the theoretical context (e.g., [14], [16], [29], [34], [41], [50], [51], [55]- [57]). However, the practical performance of regenerating codes remains uncertain.…”
Section: Introductionmentioning
confidence: 99%
“…The closest related works are on the repair problem, providing mechanisms for preserving the level of redundancy when one or more nodes fail or leave the system [25]. To this end, different symmetric and asymmetric network and erasure coding mechanisms have been proposed [26], [22], [27] that either rebuild a node with the same functionality as the failed node (functional repair) from the surviving nodes [22], [27], or reconstruct an exact copy of the failed node (exact repair) [28]. In [22], the notion of regenerating codes has been introduced to decrease the repair bandwidth by allowing a new node to communicate functions of the stored data from the surviving nodes.…”
Section: Related Workmentioning
confidence: 99%
“…In [22], the notion of regenerating codes has been introduced to decrease the repair bandwidth by allowing a new node to communicate functions of the stored data from the surviving nodes. Similarly, in [27], another solution for multiple node failures in a distributed storage system has been proposed. This solution is based on a mutually cooperative recovery (MCR) mechanism and it has been shown that this mechanism matches the lower bound maintenance bandwidth.…”
Section: Related Workmentioning
confidence: 99%
“…It makes data available closer to the user in distributed system [6]. The types of distributed storage system are Redundant Array of Independent Disks (RAID), Centralized RAID, Network Attached Storage (NAS) and Storage Area Network (SAN).…”
Section: Distributed Storage Systemmentioning
confidence: 99%