Survivable distributed storage with progressive decoding

Authors:
Yunghsiang S. Han;Soji Omiwade;Rong Zheng
Affiliations:
Graduate Institute of Communication Engineering, National Taipei University, Taiwan and Department of Computer Science and Information Engineering, National Chi Nan University, Taiwan;Department of Computer Science, University of Houston, Houston, TX;Department of Computer Science, University of Houston, Houston, TX
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 6
Cited 0

Numerical recipes in C: the art of scientific computing

Numerical recipes in C: the art of scientific computing
Fast algorithms with preprocessing for matrix-vector multiplication problems

Journal of Complexity
Efficient Byzantine-Tolerant Erasure-Coded Storage

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Error Correction Coding: Mathematical Methods and Algorithms

Error Correction Coding: Mathematical Methods and Algorithms
Decentralized erasure codes for distributed networked storage

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A performance evaluation and examination of open-source erasure coding libraries for storage

FAST '09 Proccedings of the 7th conference on File and storage technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a storage-optimal and computation efficient primitive to spread information from a single data source to a set of storage nodes, to allow recovery from both crash-stop and Byzantine failures. A progressive data retrieval scheme is employed, which retrieves minimal amount of data from live storage nodes. The scheme adapts the cost of successful data retrieval to the degree of errors in the system. Implementation and evaluation studies demonstrate comparable performance to that of a genie-aid decoding process.