Product matrix minimum storage regenerating codes with flexible number of helpers

Kaveh Mahdaviani; Soheil Mohajer; Ashish Khisti

doi:10.1109/ITW.2017.8278018

Product matrix minimum storage regenerating codes with flexible number of helpers

Kaveh Mahdaviani, Soheil Mohajer, Ashish Khisti

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

3 Scopus citations

Abstract

In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the number of helper nodes participating in a repair process, are predetermined. However, depending on the state of the system and network traffic, it is desirable to adapt such parameters accordingly in order to minimize the cost of repair. In this work a class of regenerating codes with minimum storage is introduced that can simultaneously operate at the optimal repair bandwidth, for a wide range of exact repair mechanisms, based on different number of helper nodes.

Original language	English (US)
Title of host publication	2017 IEEE Information Theory Workshop, ITW 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	41-45
Number of pages	5
ISBN (Electronic)	9781509030972
DOIs	https://doi.org/10.1109/ITW.2017.8278018
State	Published - Jul 2 2017
Externally published	Yes
Event	2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China Duration: Nov 6 2017 → Nov 10 2017

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2018-January
ISSN (Print)	2157-8095

Other

Other	2017 IEEE Information Theory Workshop, ITW 2017
Country/Territory	Taiwan, Province of China
City	Kaohsiung
Period	11/6/17 → 11/10/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Access

10.1109/ITW.2017.8278018

OpenUrl availability

Full text

Cite this

Mahdaviani, K., Mohajer, S., & Khisti, A. (2017). Product matrix minimum storage regenerating codes with flexible number of helpers. In 2017 IEEE Information Theory Workshop, ITW 2017 (pp. 41-45). (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2017.8278018

Product matrix minimum storage regenerating codes with flexible number of helpers. / Mahdaviani, Kaveh; Mohajer, Soheil; Khisti, Ashish.
2017 IEEE Information Theory Workshop, ITW 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 41-45 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-January).

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

Mahdaviani, K, Mohajer, S & Khisti, A 2017, Product matrix minimum storage regenerating codes with flexible number of helpers. in 2017 IEEE Information Theory Workshop, ITW 2017. IEEE International Symposium on Information Theory - Proceedings, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 41-45, 2017 IEEE Information Theory Workshop, ITW 2017, Kaohsiung, Taiwan, Province of China, 11/6/17. https://doi.org/10.1109/ITW.2017.8278018

@inproceedings{8ce3262d05754e7aae3776fe1533f560,

title = "Product matrix minimum storage regenerating codes with flexible number of helpers",

abstract = "In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the number of helper nodes participating in a repair process, are predetermined. However, depending on the state of the system and network traffic, it is desirable to adapt such parameters accordingly in order to minimize the cost of repair. In this work a class of regenerating codes with minimum storage is introduced that can simultaneously operate at the optimal repair bandwidth, for a wide range of exact repair mechanisms, based on different number of helper nodes.",

author = "Kaveh Mahdaviani and Soheil Mohajer and Ashish Khisti",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE Information Theory Workshop, ITW 2017 ; Conference date: 06-11-2017 Through 10-11-2017",

year = "2017",

month = jul,

day = "2",

doi = "10.1109/ITW.2017.8278018",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

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

pages = "41--45",

booktitle = "2017 IEEE Information Theory Workshop, ITW 2017",

}

TY - GEN

T1 - Product matrix minimum storage regenerating codes with flexible number of helpers

AU - Mahdaviani, Kaveh

AU - Mohajer, Soheil

AU - Khisti, Ashish

PY - 2017/7/2

Y1 - 2017/7/2

N2 - In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the number of helper nodes participating in a repair process, are predetermined. However, depending on the state of the system and network traffic, it is desirable to adapt such parameters accordingly in order to minimize the cost of repair. In this work a class of regenerating codes with minimum storage is introduced that can simultaneously operate at the optimal repair bandwidth, for a wide range of exact repair mechanisms, based on different number of helper nodes.

AB - In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the number of helper nodes participating in a repair process, are predetermined. However, depending on the state of the system and network traffic, it is desirable to adapt such parameters accordingly in order to minimize the cost of repair. In this work a class of regenerating codes with minimum storage is introduced that can simultaneously operate at the optimal repair bandwidth, for a wide range of exact repair mechanisms, based on different number of helper nodes.

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

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

U2 - 10.1109/ITW.2017.8278018

DO - 10.1109/ITW.2017.8278018

M3 - Conference contribution

AN - SCOPUS:85044211543

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 41

EP - 45

BT - 2017 IEEE Information Theory Workshop, ITW 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE Information Theory Workshop, ITW 2017

Y2 - 6 November 2017 through 10 November 2017

ER -

Product matrix minimum storage regenerating codes with flexible number of helpers

Abstract

Publication series

Other

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this