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.|
|Number of pages||5|
|State||Published - Jan 31 2018|
|Event||2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China|
Duration: Nov 6 2017 → Nov 10 2017
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Other||2017 IEEE Information Theory Workshop, ITW 2017|
|Country/Territory||Taiwan, Province of China|
|Period||11/6/17 → 11/10/17|
Bibliographical noteFunding Information:
The work of S. Mohajer is supported by the National Science Foundation under Grant CCF-1617884.
© 2017 IEEE.