Replicated erasure codes for storage and repair-traffic efficiency

Roy Friedman; Yoav Kantor; Amir Kantor

doi:10.1109/P2P.2014.6934310

Replicated erasure codes for storage and repair-traffic efficiency

Roy Friedman, Yoav Kantor, Amir Kantor

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings
ISBN (Electronic)	9781479962013
DOIs	https://doi.org/10.1109/P2P.2014.6934310
State	Published - 22 Oct 2014
Event	14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - London, United Kingdom Duration: 9 Sep 2014 → 11 Sep 2014

Publication series

Name	14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings

Conference

Conference	14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014
Country/Territory	United Kingdom
City	London
Period	9/09/14 → 11/09/14

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/P2P.2014.6934310

Cite this

@inproceedings{c802bda956ce41069c3dd0f869db1924,

title = "Replicated erasure codes for storage and repair-traffic efficiency",

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.",

author = "Roy Friedman and Yoav Kantor and Amir Kantor",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 ; Conference date: 09-09-2014 Through 11-09-2014",

year = "2014",

month = oct,

day = "22",

doi = "10.1109/P2P.2014.6934310",

language = "الإنجليزيّة",

series = "14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings",

booktitle = "14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings",

}

Friedman, R, Kantor, Y & Kantor, A 2014, Replicated erasure codes for storage and repair-traffic efficiency. in 14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings., 6934310, 14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings, 14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014, London, United Kingdom, 9/09/14. https://doi.org/10.1109/P2P.2014.6934310

Replicated erasure codes for storage and repair-traffic efficiency. / Friedman, Roy; Kantor, Yoav; Kantor, Amir.
14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings. 2014. 6934310 (14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Replicated erasure codes for storage and repair-traffic efficiency

AU - Friedman, Roy

AU - Kantor, Yoav

AU - Kantor, Amir

PY - 2014/10/22

Y1 - 2014/10/22

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84949135846&partnerID=8YFLogxK

U2 - 10.1109/P2P.2014.6934310

DO - 10.1109/P2P.2014.6934310

M3 - منشور من مؤتمر

T3 - 14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings

BT - 14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014 - Proceedings

T2 - 14th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2014

Y2 - 9 September 2014 through 11 September 2014

ER -

Replicated erasure codes for storage and repair-traffic efficiency

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this