A probabilistic approach towards exact-repair regeneration codes

Mehran Elyasi; Soheil Mohajer

doi:10.1109/ALLERTON.2015.7447097

A probabilistic approach towards exact-repair regeneration codes

Mehran Elyasi, Soheil Mohajer

Electrical and Computer Engineering

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

7 Scopus citations

Abstract

Regeneration codes with exact-repair property for distributed storage systems is studied in this paper. For exact-repair problem, the achievable points of (α,β) tradeoff match with the outer bound only for minimum storage regenerating (MSR), minimum bandwidth regenerating (MBR), and some specific values of n, k, and d. Such tradeoff is characterized in this work for general (n, k, k), (i.e., k = d) for some range of per-node storage (α) and repair-bandwidth (β). Rather than explicit code construction, achievability of these tradeoff points is shown by proving existence of exact-repair regeneration codes for any (n, k, k). More precisely, it is shown that an (n, k, k) system can be extended by adding a new node, which is randomly picked from some ensemble, and it is proved that, with high probability, the existing nodes together with the newly added one maintain properties of exact-repair regeneration codes. The new achievable region improves upon the existing code constructions. In particular, this result provides a complete tradeoff characterization for an (n, 3, 3) distributed storage system for any value of n.

Original language	English (US)
Title of host publication	2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	865-872
Number of pages	8
ISBN (Electronic)	9781509018239
DOIs	https://doi.org/10.1109/ALLERTON.2015.7447097
State	Published - Apr 4 2016
Event	53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 - Monticello, United States Duration: Sep 29 2015 → Oct 2 2015

Publication series

Name	2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

Other

Other	53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
Country/Territory	United States
City	Monticello
Period	9/29/15 → 10/2/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Access

10.1109/ALLERTON.2015.7447097

OpenUrl availability

Full text

Cite this

Elyasi, M., & Mohajer, S. (2016). A probabilistic approach towards exact-repair regeneration codes. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 (pp. 865-872). Article 7447097 (2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2015.7447097

A probabilistic approach towards exact-repair regeneration codes. / Elyasi, Mehran; Mohajer, Soheil.
2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015. Institute of Electrical and Electronics Engineers Inc., 2016. p. 865-872 7447097 (2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015).

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

Elyasi, M & Mohajer, S 2016, A probabilistic approach towards exact-repair regeneration codes. in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015., 7447097, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Institute of Electrical and Electronics Engineers Inc., pp. 865-872, 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Monticello, United States, 9/29/15. https://doi.org/10.1109/ALLERTON.2015.7447097

Elyasi M, Mohajer S. A probabilistic approach towards exact-repair regeneration codes. In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015. Institute of Electrical and Electronics Engineers Inc. 2016. p. 865-872. 7447097. (2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015). doi: 10.1109/ALLERTON.2015.7447097

@inproceedings{c5976c4134a84d2ba658289a4dde306e,

title = "A probabilistic approach towards exact-repair regeneration codes",

abstract = "Regeneration codes with exact-repair property for distributed storage systems is studied in this paper. For exact-repair problem, the achievable points of (α,β) tradeoff match with the outer bound only for minimum storage regenerating (MSR), minimum bandwidth regenerating (MBR), and some specific values of n, k, and d. Such tradeoff is characterized in this work for general (n, k, k), (i.e., k = d) for some range of per-node storage (α) and repair-bandwidth (β). Rather than explicit code construction, achievability of these tradeoff points is shown by proving existence of exact-repair regeneration codes for any (n, k, k). More precisely, it is shown that an (n, k, k) system can be extended by adding a new node, which is randomly picked from some ensemble, and it is proved that, with high probability, the existing nodes together with the newly added one maintain properties of exact-repair regeneration codes. The new achievable region improves upon the existing code constructions. In particular, this result provides a complete tradeoff characterization for an (n, 3, 3) distributed storage system for any value of n.",

author = "Mehran Elyasi and Soheil Mohajer",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 ; Conference date: 29-09-2015 Through 02-10-2015",

year = "2016",

month = apr,

day = "4",

doi = "10.1109/ALLERTON.2015.7447097",

language = "English (US)",

series = "2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "865--872",

booktitle = "2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015",

}

TY - GEN

T1 - A probabilistic approach towards exact-repair regeneration codes

AU - Elyasi, Mehran

AU - Mohajer, Soheil

PY - 2016/4/4

Y1 - 2016/4/4

N2 - Regeneration codes with exact-repair property for distributed storage systems is studied in this paper. For exact-repair problem, the achievable points of (α,β) tradeoff match with the outer bound only for minimum storage regenerating (MSR), minimum bandwidth regenerating (MBR), and some specific values of n, k, and d. Such tradeoff is characterized in this work for general (n, k, k), (i.e., k = d) for some range of per-node storage (α) and repair-bandwidth (β). Rather than explicit code construction, achievability of these tradeoff points is shown by proving existence of exact-repair regeneration codes for any (n, k, k). More precisely, it is shown that an (n, k, k) system can be extended by adding a new node, which is randomly picked from some ensemble, and it is proved that, with high probability, the existing nodes together with the newly added one maintain properties of exact-repair regeneration codes. The new achievable region improves upon the existing code constructions. In particular, this result provides a complete tradeoff characterization for an (n, 3, 3) distributed storage system for any value of n.

AB - Regeneration codes with exact-repair property for distributed storage systems is studied in this paper. For exact-repair problem, the achievable points of (α,β) tradeoff match with the outer bound only for minimum storage regenerating (MSR), minimum bandwidth regenerating (MBR), and some specific values of n, k, and d. Such tradeoff is characterized in this work for general (n, k, k), (i.e., k = d) for some range of per-node storage (α) and repair-bandwidth (β). Rather than explicit code construction, achievability of these tradeoff points is shown by proving existence of exact-repair regeneration codes for any (n, k, k). More precisely, it is shown that an (n, k, k) system can be extended by adding a new node, which is randomly picked from some ensemble, and it is proved that, with high probability, the existing nodes together with the newly added one maintain properties of exact-repair regeneration codes. The new achievable region improves upon the existing code constructions. In particular, this result provides a complete tradeoff characterization for an (n, 3, 3) distributed storage system for any value of n.

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

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

U2 - 10.1109/ALLERTON.2015.7447097

DO - 10.1109/ALLERTON.2015.7447097

M3 - Conference contribution

AN - SCOPUS:84969767060

T3 - 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

SP - 865

EP - 872

BT - 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

Y2 - 29 September 2015 through 2 October 2015

ER -

A probabilistic approach towards exact-repair regeneration codes

Abstract

Publication series

Other

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this