TY - GEN
T1 - Fractional repetition codes based on partially ordered sets
AU - Aydinian, Harout
AU - Boche, Holger
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - Fractional repetition (FR) codes is a class of codes which were recently introduced for distributed storage systems. These codes are intended for exact uncoded repair of node failures, by downloading symbols from a suitable subset of surviving nodes. The repair procedure in FR codes is table based, unlike the regenerating codes, where the repair of a failed node is possible using arbitrary subset of a given size from surviving nodes. The advantage of this relaxation is that it allows to achieve low complexity in repair process, while these codes have minimum repair bandwidth like minimum bandwidth regenerating (MBR) codes. In this paper we give new and simple constructions for universally good FR codes based on partially ordered sets. These codes allow for efficient uncoded repair and the resulting designs are scalable and easy to implement. In particular, they allow to store larger files as compared to MBR codes. Furthermore, the constructions can be extended to FR codes for heterogeneous storage systems.
AB - Fractional repetition (FR) codes is a class of codes which were recently introduced for distributed storage systems. These codes are intended for exact uncoded repair of node failures, by downloading symbols from a suitable subset of surviving nodes. The repair procedure in FR codes is table based, unlike the regenerating codes, where the repair of a failed node is possible using arbitrary subset of a given size from surviving nodes. The advantage of this relaxation is that it allows to achieve low complexity in repair process, while these codes have minimum repair bandwidth like minimum bandwidth regenerating (MBR) codes. In this paper we give new and simple constructions for universally good FR codes based on partially ordered sets. These codes allow for efficient uncoded repair and the resulting designs are scalable and easy to implement. In particular, they allow to store larger files as compared to MBR codes. Furthermore, the constructions can be extended to FR codes for heterogeneous storage systems.
KW - Distributed storage system
KW - Fractional repetition code
KW - Partially ordered set
KW - Regenerating code
UR - http://www.scopus.com/inward/record.url?scp=85046361193&partnerID=8YFLogxK
U2 - 10.1109/ITW.2017.8277958
DO - 10.1109/ITW.2017.8277958
M3 - Conference contribution
AN - SCOPUS:85046361193
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 51
EP - 55
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 -