Research and Implementation of Optimizing CRS Code for Data Recovery in Cloud Storage System

Article Preview

Abstract:

With development of computer technology, massive information has brought huge challenge on the storage system reliability. A algorithm called HG(Heuristic greedy) algorithm is proposed to optimal calculation path, reduce XOR operation and computational complexity for data recovery, which applies CRS(Cauchy Reed-Solomon) code to cloud storage system HDFS and turns multiply operation of CRS coding to binary matrix multiplication operation.The performance analysis shows that it improves fault tolerance of cloud file system, storage space effectively and timeliness with reduction of additional storage overhead.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1915-1918

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Shvachko K, Kuang H, Radia S, et al. The Hadoop distributed file system[C]. Proceedings of the 26th IEEE Symposium on Mass Storage Systems and Technologies. Washington, DC, USA: IEEE Computer Society, 2010: 1-10.

DOI: 10.1109/msst.2010.5496972

Google Scholar

[2] Xu Weilong. The analysis and design of a data backup system based on HDFS[D]. Beijing University of Posts and Telecommunications, (2013).

Google Scholar

[3] Luo Xianghong, Shu Jiwu. Summary of research for erasure code in storage system. Journal of computer research and development, 2012, 01: 1-11.

Google Scholar

[4] Zhang Xiaohu. Research on redundant data storage based on DHT[D]. Xi'an University of Electronic Science and Technology. (2012).

Google Scholar

[5] J. S. Plank, and L. Xu, Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications, IEEE International Symposium on Network Computing and Applications (NCA 2006), Cambridge, MA, Jul., (2006).

DOI: 10.1109/nca.2006.43

Google Scholar

[6] Huang, C., J. Li, and M. Chen. On optimizing XOR-based codes for fault-tolerant storage applications. "In ITW, 07, Information Theory Workshop (Tahoe City, CA, September 2007), IEEE, p.218–223.

DOI: 10.1109/itw.2007.4313077

Google Scholar

[7] Catherine Schuman, James S. Plank, An Exploration of Optimization Algorithms and Heuristice for the Creation of Encoding and Decoding Schedules in Erasure Coding, Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, (2011).

Google Scholar