Survivable distributed storage with progressive decoding

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Han, Yunghsiang S ^a,b   Omiwade, Soji ^c   Zheng, Rong ^c  

^a NATIONAL TAIPEI UNIVERSITY   (Taiwan)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^c University of Houston   (United States)

Author keywords

Byzantine failures; Error detection code; Network storage; Reed Solomon code

Indexed keywords

BYZANTINE FAILURES; DATA RETRIEVAL; DATA SOURCE; DECODING PROCESS; DISTRIBUTED STORAGE; EVALUATION STUDY; NETWORK STORAGE; PROGRESSIVE DECODING; STORAGE NODES;

DATA COMMUNICATION EQUIPMENT; DECODING; REED-SOLOMON CODES; TESTBEDS;

ERROR DETECTION;

EID: 77953307713     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462198     Document Type: Conference Paper

References (11)

1. "RAID, Redundant Array of Independent Disks," http://en.wikipedia.org/wiki/Redundant-array-of-independent-disks.
2. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter, "Efficient byzantine-tolerant erasure-coded storage," in DSN '04: Proceedings of the 2004 International Conference on Dependable Systems and Networks, 2004, p. 135.
3. Y. S. Han, S. Omiwade, and R. Zheng, "Survivable distributed storage with progressive decoding," Technical Report UH-CS-09-17, Department of Computer Science, University of Houston, 2009.
4. T. K. Moon, Error Correction Coding: Mathematical Methods and Algorithms, Hoboken, NJ: John Wiley & Sons, Inc., 2005.
5. H. William, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C: The art of scientific computing, Cambridge university press New York, NY, USA, 1988.
6. Y. Lin, B. Liang, and B. Li, "Data persistence in large-scale sensor networks with decentralized fountain codes," in Proceedings of the 26th IEEE INFOCOM, 2007, pp. 6-12.
7. J. S. Plank, J. Luo, C. D. Schuman, L. Xu, and Z. Wilcox-O'Hearn, "A performance evaluation and examination of open-source erasure coding libraries for storage," in FAST '09: Proccedings of the 7th conference on File and storage technologies, 2009, pp. 253-265.
8. K. Araki, M. Takada, and M. Morii, "On the efficient decoding of Reed-Solomon codes based on GMD criterion," in Proc. of the International Symposium on Multiple-Valued Logic, Sendai, Japan, May 1992, pp. 138-145.
9. rd edition, 2004.
10. I. Gohberg and V. Olshevsky, "Fast algorithms with preprocessing for matrix-vector multiplication problem," J. Complexity, vol. 10, pp. 411-427, December 1994.
11. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized erasure codes for distributed networked storage," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2809-2816, June 2006.