Cooperative Regenerating Codes for Distributed Storage Systems

被引：0
|
作者：
Shum, Kenneth W. [1 ]
机构：
[1] Chinese Univ Hong Kong, Inst Network Coding, Shatin, Hong Kong, Peoples R China
来源：
2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2011年
关键词：
Distributed Storage; Repair Bandwidth; Regenerating Codes; Erasure Codes; Network Coding;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
When there are multiple node failures in a distributed storage system, regenerating the failed storage nodes individually in a one-by-one manner is suboptimal as far as repair-bandwidth minimization is concerned. If data exchange among the newcomers is enabled, we can get a better tradeoff between repair bandwidth and the storage per node. An explicit and optimal construction of cooperative regenerating code is illustrated.
引用
收藏
页数：5
相关论文
共 50 条
  • [41] Security for Minimum Storage Regenerating Codes and Locally Repairable Codes
    Kadhe, Swanand
    Sprintson, Alex
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1028 - 1032
  • [42] A Survey on Network Codes for Distributed Storage
    Dimakis, Alexandros G.
    Ramchandran, Kannan
    Wu, Yunnan
    Suh, Changho
    PROCEEDINGS OF THE IEEE, 2011, 99 (03) : 476 - 489
  • [43] Optimal Weakly Secure Minimum Storage Regenerating Codes Scheme
    Bian, Jianchao
    Luo, Shoushan
    Li, Zhengwen
    Yang, Yixian
    IEEE ACCESS, 2019, 7 : 151120 - 151130
  • [44] Secure Codes With Accessibility for Distributed Storage
    Holzbaur, Lukas
    Kruglik, Stanislav
    Frolov, Alexey
    Wachter-Zeh, Antonia
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2021, 16 : 5326 - 5337
  • [45] A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems
    Li, Jie
    Tang, Xiaohu
    Tian, Chao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (09) : 6257 - 6267
  • [46] RapidRAID: Pipelined Erasure Codes for Fast Data Archival in Distributed Storage Systems
    Pamies-Juarez, Lluis
    Datta, Anwitaman
    Oggier, Frederique
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 1294 - 1302
  • [47] Efficient multi-node regenerating program with healthy nodes collaboration in distributed storage systems
    Xie, X.-Z. (xiexzh@cqupt.edu.cn), 1600, Beijing University of Posts and Telecommunications (37): : 52 - 56
  • [48] On Secrecy Capacity of Minimum Storage Regenerating Codes
    Huang, Kun
    Parampalli, Udaya
    Xian, Ming
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (03) : 1510 - 1524
  • [49] Secrecy Capacity of Minimum Storage Regenerating Codes
    Rawat, Ankit Singh
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1406 - 1410
  • [50] On the data persistency of replicated erasure codes in distributed storage systems
    Friedman, Roy
    Kapelko, Rafal
    Marchwicki, Karol
    INFORMATION AND COMPUTATION, 2025, 304
12345