A Multi-Server Erasure Code Algorithm Based on the Degree of Restriction

Article Preview

Abstract:

Erasure codes received extensive attention in the cloud storage system because of its effective on saving storage space,However, due to the high recovery-overhead of erasure code, its application has been limited in these storage systems.For these problems,in this paper,we presents A multi-server Erasure code algorithm based on the degree of restriction to reduce the recovery-overhead from the restriction of date and parity's degree,and enhance the system performance to a certain extent ,ensure the reliability of the data of the cloud storage environment.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

789-793

Citation:

Online since:

July 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] I F, Y Z, I R, et al. Cloud Computing and Grid Computing 360-Degree Compared[Z]. Los Alamitos: 2008.

Google Scholar

[2] SCHMUCK F, HASKIN R. GPFS: A sh ared-disk file system for large computing clusters [C ] / / Proceedings of the Conference on File and Storage Technologies. Monterey, CA: [ s. n. ], 2002: 231- 244.

Google Scholar

[3] CHU C-C,H SU C-H. A perform ance-effective and high scalable grid file system [C] / / MUE 2008: 2008 International Conference on Multimedia and Ubiquitous Engineering. Washington, D C: IEEE Computer Society, 2008: 460- 465.

DOI: 10.1109/mue.2008.115

Google Scholar

[4] WANG QIAN, WANG CONG,LI JIN.Enabling public verifiability and data dynamics for storage security in cloud computing [C] / /ESORICS'09: Proceedings of the 14th European Conference on Research in Computer Security. Berlin: Springer-Verlag, 2009: 355 -370.

DOI: 10.1007/978-3-642-04444-1_22

Google Scholar

[5] WEATHERSPOON H. KUBIATOW ICZ J. Erasure coding vs replication: A quantitative com parison [ C ] / / IPTPS 2002: Proceedings of First International Work shop on Peer-to-Peer System s. Berlin: Sp ringer-Verlag, 2002: 328 - 338.

DOI: 10.1007/3-540-45748-8_31

Google Scholar

[6] Rizzo L.On the Feasibility of Software FEC[EB/OL]..http:/ /teamfrednet-mockups.googlecode.com/files/Rizzo-Feas-Soft-FEC-97.pdf,2012.04.04

Google Scholar

[7] Plank J.Erasure Codes for Storage Applications[EB/OL].http://web.eecs.utk.edu / ~ plank /plank /papers /FAST-2005.html,2012-04-04.

Google Scholar

[8] Hafner J L. Weaver codes: Highly fault tolerant erasure codes for storage systems[C]. In: USENIX Association, 2005. 16.

Google Scholar

[9] Kamra A, Feldman J, Misra V, et al. Growth codes: Maximizing sensor network data persistence[Z]. 2006.

DOI: 10.1145/1159913.1159943

Google Scholar

[10] Huang C, Chen M, Li J. Pyramid Codes:Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems[Z]. 2007.

DOI: 10.1109/nca.2007.37

Google Scholar