Heterogeneity-Aware Codes With Uncoded Repair for Distributed Storage Systems

被引：15
作者：
Zhu, Bing [1 ]
Shum, Kenneth W. [2 ]
Li, Hui [3 ,4 ]
机构：
[1] Peking Univ, Sch Elect & Comp Engn, Shenzhen 518055, Peoples R China
[2] Chinese Univ Hong Kong, Inst Network Coding, Shatin, Hong Kong, Peoples R China
[3] Peking Univ, Inst Big Data Technol, Shenzhen 518055, Peoples R China
[4] Peking Univ, Shenzhen Engn Lab Converged Networks Technol, Shenzhen 518055, Peoples R China
来源：
IEEE COMMUNICATIONS LETTERS | 2015年 / 19卷 / 06期
关键词：
Distributed storage systems; regenerating codes; repair bandwidth; uncoded repair; combinatorial designs; EXACT-REGENERATING CODES;
D O I：
10.1109/LCOMM.2015.2415495
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
In practical large-scale distributed storage systems, node failures are unavoidable. It is therefore desirable to quickly recreate the failed nodes in order to maintain the system integrity. In this letter, we consider a family of erasure codes that provide uncoded repair, where the failed node is regenerated by transfer of data without extra arithmetic operations. We introduce flexible fractional repetition (FFR) code, of which the coding scheme is a concatenation of an outer MDS code and an inner repetition code. Our proposed codes are applicable to the heterogeneous network environment where node storage capacities and packet repetition degrees vary in a wide range. We present explicit constructions of FFR codes by utilizing combinatorial designs. We further propose a heuristic code construction. Evaluation results show that FFR codes outperform regenerating codes in node repair efficiency.
引用
收藏
页码：901 / 904
页数：4
相关论文
共 18 条
  • [1] [Anonymous], 2012, P FAST
  • [2] Beth T., 1999, DESIGN THEORY, DOI 10.1017/CBO9781139507660
  • [3] Colbourn C. J., 2006, Handbook of Combinatorial Designs (Discrete Mathematics and Its Applications), V2nd
  • [4] Network Coding for Distributed Storage Systems
    Dimakis, Alexandros G.
    Godfrey, P. Brighten
    Wu, Yunnan
    Wainwright, Martin J.
    Ramchandran, Kannan
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) : 4539 - 4551
  • [5] El Rouayheb S., 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P1510, DOI 10.1109/ALLERTON.2010.5707092
  • [6] Gerami M, 2011, IEEE INT SYMP INFO, P1437, DOI 10.1109/ISIT.2011.6033777
  • [7] Ghemawat S, 2003, ACM SIGOPS Operating Systems Review, P29, DOI [10.1145/1165389.945450, 10.1145/945445.945450]
  • [8] Gupta M. K., 2013, ARXIV13023681V1CSIT
  • [9] Koo Joseph C., 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P1366
  • [10] Olmez O, 2012, ANN ALLERTON CONF, P1174, DOI 10.1109/Allerton.2012.6483351
12