Exact-Repair Codes With Partial Collaboration in Distributed Storage Systems

被引:4
|
作者
Liu, Shiqiu [1 ]
Shum, Kenneth W. [2 ]
Li, Congduan [1 ]
机构
[1] Sun Yat Sen Univ, Sch Elect & Commun Engn, Guangzhou 510275, Peoples R China
[2] Chinese Univ Hong Kong Shenzhen, Sch Sci & Engn, Shenzhen 518172, Peoples R China
基金
美国国家科学基金会;
关键词
Maintenance engineering; Collaboration; Bandwidth; Hard disks; Distributed databases; Encoding; Servers; Partial collaboration; minimum storage; minimum repair bandwidth; code construction; COOPERATIVE REGENERATING CODES; BANDWIDTH;
D O I
10.1109/TCOMM.2020.2988924
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The partially collaborative repair of multiple node failures in distributed storage systems is investigated. An exact-repair code is constructed using a bilinear form, which achieves the minimum-bandwidth partially collaborative repair (MBPCR) point. When the storage capacity is minimum, the problem of repairing multi-node failures using a Maximum Distance Separable (MDS) array code is also investigated. The minimum-storage partially collaborative repair (MSPCR) problem with same number of repairing and reconstruction nodes has been studied before. In this paper, the scenario where the number of repairing nodes is greater than that of reconstruction nodes and the storage capacity is already minimal for partial collaboration is considered. An MDS array code is constructed, which asymptotically achieves the MSPCR point. Further, we show that the given code construction could not always have a regular collaborative structure.
引用
收藏
页码:4012 / 4021
页数:10
相关论文
共 50 条
  • [21] Quasicyclic MDS Codes for Distributed Storage with Efficient Exact Repair
    Thangaraj, Andrew
    Sankar, Chinnadhurai
    2011 IEEE INFORMATION THEORY WORKSHOP (ITW), 2011,
  • [22] On Secure Distributed Storage Systems with Exact Repair
    Tandon, Ravi
    Amuru, SaiDhiraj
    Clancy, T. Charles
    Buehrer, R. Michael
    2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 3908 - 3912
  • [23] The Rate Region of Secure Exact-Repair Regenerating Codes for 5 Nodes
    Ye, Fangwei
    Shum, Kenneth W.
    Yeung, Raymond W.
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1406 - 1410
  • [24] Improved Layered Regenerating Codes Characterizing the Exact-Repair Storage-Repair Bandwidth Tradeoff for Certain Parameter Sets
    Senthoor, Kaushik
    Sasidharan, Birenjith
    Kumar, P. Vijay
    2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
  • [25] On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point
    Ye, Fangwei
    Liu, Shiqiu
    Shum, Kenneth W.
    Yeung, Raymond W.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (01) : 176 - 201
  • [26] Scalable (n, k, d) Exact-Repair Regenerating Codes with Small Repair Bandwidth
    Elyasi, Mehran
    Mohajer, Soheil
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [27] Improve readability with Exact Hierarchical Codes in Distributed Storage Systems
    Huang, Zhen
    Wang, Changjian
    Yuan, Yuan
    Liu, Lixia
    Peng, Yuxing
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2012, 15 (11A): : 4411 - 4416
  • [28] An Outer Bound on the Storage-Bandwidth Tradeoff of Exact-Repair Regenerating Codes and its Asymptotic Optimality in High Rates
    Lee, Hyuk
    Lee, Jungwoo
    2016 IEEE INFORMATION THEORY WORKSHOP (ITW), 2016,
  • [29] Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs
    Tian, Chao
    Aggarwal, Vaneet
    Vaishampayan, Vinay A.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1431 - 1435
  • [30] A New Construction of Exact-Repair MSR Codes Using Linearly Dependent Vectors
    Guan, Sheng
    Kan, Haibin
    Wen, Jie
    Xia, Shuli
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (08) : 1691 - 1694