DocumentCode :
131816
Title :
Replicated erasure codes for storage and repair-traffic efficiency
Author :
Friedman, R. ; Kantor, Yoav ; Kantor, Amir
Author_Institution :
Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel
fYear :
2014
fDate :
8-12 Sept. 2014
Firstpage :
1
Lastpage :
10
Abstract :
This paper introduces a new family of redundancy schemes for distributed storage systems, called replicated erasure codes (REC), which combine the storage-space efficiency of erasure codes and the repair-traffic efficiency of replication. A formal model for analyzing the storage and repair-traffic costs under availability and persistency constraints is also developed. It is shown that under parameters that characterize common P2P environments, REC generally achieves better results than each of the two methods separately.
Keywords :
distributed memory systems; error correction codes; peer-to-peer computing; P2P environments; REC; distributed storage systems; redundancy schemes; repair-traffic costs; repair-traffic efficiency; replicated erasure codes; storage-space efficiency; Analytical models; Availability; Conferences; Maintenance engineering; Peer-to-peer computing; Probability; Redundancy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Peer-to-Peer Computing (P2P), 14-th IEEE International Conference on
Conference_Location :
London
Print_ISBN :
978-1-4799-6200-6
Type :
conf
DOI :
10.1109/P2P.2014.6934310
Filename :
6934310
Link To Document :
بازگشت