|Title:||Combining Erasure-Code and Replication Redundancy Schemes for Increased Storage and Repair Efficiency in P2P Storage Systems
|Authors:||Roy Friedman, Yoav Kantor, Amir Kantor
|Abstract:||This paper introduces a new family of redundancy schemes called replicated erasure codes (REC), which combine the storage-space efficiency of erasure codes and the repair-traffic efficiency of replications. A formal model for analyzing the storage and repair-raffic 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.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2013/CS/CS-2013-03), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 2013
To the main CS technical reports page
Computer science department, Technion