TY - JOUR
T1 - Graftage Coding for Distributed Storage Systems
AU - Huang, Qin
AU - Rui, Jiayi
AU - Song, Liyuan
AU - Wang, Zulin
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018
Y1 - 2018
N2 - Recently, several remarkable works [1]-[5] constructed regenerating codes to offer intermediate tradeoffs between storage and bandwidth. Unlike regenerating codes, this paper proposes to graft codes together to provide various such intermediate tradeoffs. It shows that the linear relations in the generator matrices of grafting codes can be transferred to those of grafted codes without any loss of reconstruction capability. A construction based on minimum storage regenerating codes shows that the resulted graftage codes may provide better tradeoffs than space-sharing and approach cut-set bounds, with the cost of fixed access of helper nodes.
AB - Recently, several remarkable works [1]-[5] constructed regenerating codes to offer intermediate tradeoffs between storage and bandwidth. Unlike regenerating codes, this paper proposes to graft codes together to provide various such intermediate tradeoffs. It shows that the linear relations in the generator matrices of grafting codes can be transferred to those of grafted codes without any loss of reconstruction capability. A construction based on minimum storage regenerating codes shows that the resulted graftage codes may provide better tradeoffs than space-sharing and approach cut-set bounds, with the cost of fixed access of helper nodes.
KW - bandwidth
KW - Distributed storage system
KW - graftage codes
KW - interference alignment
KW - storage
UR - https://www.scopus.com/pages/publications/85063431142
U2 - 10.1109/GLOCOM.2018.8647333
DO - 10.1109/GLOCOM.2018.8647333
M3 - 会议文章
AN - SCOPUS:85063431142
SN - 2334-0983
JO - Proceedings - IEEE Global Communications Conference, GLOBECOM
JF - Proceedings - IEEE Global Communications Conference, GLOBECOM
M1 - 8647333
T2 - 2018 IEEE Global Communications Conference, GLOBECOM 2018
Y2 - 9 December 2018 through 13 December 2018
ER -