אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

This work 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.