Explicit MBR All-Symbol Locality Codes

被引：0

作者：

Kamath, Govinda M. ^{[1
]}

Silberstein, Natalia ^{[2
]}

Prakash, N. ^{[1
]}

Rawat, Ankit S. ^{[2
]}

Lalitha, V. ^{[1
]}

Koyluoglu, O. Ozan ^{[2
]}

Kumar, P. Vijay ^{[1
]}

Vishwanath, Sriram ^{[2
]}

机构：

[1] Indian Inst Sci, Dept ECE, Bangalore 560012, Karnataka, India

[2] Univ Texas Austin, Dept ECE, Austin, TX 78712 USA

来源：

2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2013年

基金：

美国国家科学基金会;

关键词：

DISTRIBUTED STORAGE;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and have maximum capacity (i.e., maximum rate). Finally, the same pre-coding mechanism can be combined with a subclass of fractional-repetition codes to enable maximum resilience and repair-by-transfer simultaneously.

引用

页码：504 / +

页数：2

共 13 条

[1] Network Coding for Distributed Storage Systems [J].

Dimakis, Alexandros G. ;

Godfrey, P. Brighten ;

Wu, Yunnan ;

Wainwright, Martin J. ;

Ramchandran, Kannan .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) :4539-4551

[2]

El Rouayheb S., 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P1510, DOI 10.1109/ALLERTON.2010.5707092

[3]

Gabidulin E. M., 1985, Problems of Information Transmission, V21, P1

[4] On the Locality of Codeword Symbols [J].

Gopalan, Parikshit ;

Huang, Cheng ;

Simitci, Huseyin ;

Yekhanin, Sergey .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (11) :6925-6934

[5]

Kamath G. M., 2012, ARXIV12111932

[6]

MacWilliams F. J., 1983, THEORY ERROR CORRECT

[7]

Oggier F, 2011, IEEE INFOCOM SER, P1215, DOI 10.1109/INFCOM.2011.5934901

[8]

Papailiopoulos D. S., 2012, Proceedings of the 2012 IEEE International Symposium on Information Theory - ISIT, P2771, DOI 10.1109/ISIT.2012.6284027

[9]

Prakash N., 2012, Proceedings of the 2012 IEEE International Symposium on Information Theory - ISIT, P2776, DOI 10.1109/ISIT.2012.6284028

[10] Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction [J].

Rashmi, K. V. ;

Shah, Nihar B. ;

Kumar, P. Vijay .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) :5227-5239

← 1 2 →