Repairing multiple failures in the Suh-Ramchandran regenerating codes

Author

Junyu Chen ; Shum, Kenneth W.

Author_Institution

Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China

fYear

2013

fDate

7-12 July 2013

Firstpage

1441

Lastpage

1445

Abstract

Using the idea of interference alignment, Suh and Ramchandran constructed a class of minimum-storage regenerating codes which can repair one systematic or one parity-check node with optimal repair bandwidth. With the same code structure, we show that in addition to single node failure, double node failures can be repaired collaboratively with optimal repair bandwidth as well. We give an example of how to repair double failures in the Suh-Ramchandran regenerating code with six nodes, and give the proof for the general case.

Keywords

codes; interference; maintenance engineering; matrix algebra; storage management; telecommunication network reliability; Suh-Ramchandran regenerating codes; distributed storage system; double node failures; interference alignment; minimum-storage regenerating codes; multiple failure repair; optimal repair bandwidth; single node failure; super-regular matrix; Bandwidth; Encoding; Interference; Maintenance engineering; Systematics; Vectors; Distributed storage systems; interference alignment; regenerating codes; super-regular matrix;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on

Conference_Location

Istanbul

ISSN

2157-8095

Type

conf

DOI

10.1109/ISIT.2013.6620465

Filename

6620465