Title :
Cyclic repetition erasure code
Author :
Meng-Fei Zhang ; Shu-Tao Xia
Author_Institution :
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Shenzhen, China
Abstract :
Distributed storage systems introduce redundancy to provide high data reliability, a simple strategy is replication, but it has a drawback of low storage efficiency, another popular strategy is using erasure code, but the repair cost and complexity are very high. So we introduce the Cyclic Repetition Erasure Code (CREC) which combines the advantage of both replication and erasure code, we use maximum distance separable (MDS) code to encode original file into several blocks, replicate them and then arrange them in cyclic order. CREC has not only much higher reliability than repetition strategy but also the property of simplicity, besides the bandwidth cost of repair is optimal. These advantages make CREC easily to be applied to real system.
Keywords :
codes; redundancy; replicated databases; storage management; CREC; MDS code; bandwidth cost; cyclic repetition erasure code; data reliability; distributed storage systems; erasure code; maximum distance separable code; redundancy; replication code; Bandwidth; Educational institutions; Maintenance engineering; Peer-to-peer computing; Probability; Redundancy; cyclic repetition erasure code; distributed storage; erasure code; regenerating code;
Conference_Titel :
Consumer Electronics, Communications and Networks (CECNet), 2013 3rd International Conference on
Conference_Location :
Xianning
Print_ISBN :
978-1-4799-2859-0
DOI :
10.1109/CECNet.2013.6703309