Name
Abstract | ||
|---|---|---|
Classical erasure codes, e.g. Reed-Solomon codes, have been acknowledged as an efficient alternative to plain replication to reduce the storage overhead in reliable distributed storage systems. Yet, such codes experience high overhead during the maintenance process. In this paper we propose a novel erasure-coded framework especially tailored for networked storage systems. Our approach relies on the use of random codes coupled with a clustered placement strategy, enabling the maintenance of a failed machine at the granularity of multiple files. Our repair protocol leverages network coding techniques to reduce by half the amount of data transferred during maintenance, as several files can be repaired simultaneously. This approach, as formally proven and demonstrated by our evaluation on a public experimental testbed, enables to dramatically decrease the bandwidth overhead during the maintenance process, as well as the time to repair a failure. In addition, the implementation is made as simple as possible, aiming at a deployment into practical systems. |
Year | Venue | Field |
|---|---|---|
2012 | CoRR | Linear network coding,Software deployment,Computer science,Distributed data store,Testbed,Real-time computing,Bandwidth (signal processing),Granularity,Erasure code,Distributed computing |
DocType | Volume | Citations |
Journal | abs/1206.4175 | 0 |
PageRank | References | Authors |
0.34 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anne-Marie Kermarrec | 1 | 6649 | 453.63 |
| Erwan Le Merrer | 2 | 322 | 23.58 |
| Gilles Straub | 3 | 129 | 8.04 |
| Alexandre van Kempen | 4 | 55 | 4.29 |