Optimal Secure Partial-Repair in Distributed Storage Systems

被引:0
|
作者
Gerami, Majid [1 ]
Xiao, Ming [1 ]
Salimi, Somayeh [2 ]
Skoglund, Mikael [1 ]
Papadimitratos, Panos [1 ]
机构
[1] Royal Inst Technol, KTH, Sch Elect Engn, Stockholm, Sweden
[2] Uppsala Univ, Dept Engn Sci Signal & Syst, Uppsala, Sweden
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Consider a distributed storage system where parts of the source file fragments in storage nodes are lost. We denote a storage node that lost a part of its fragments as a faulty storage node and a storage node that lost non of its fragment as a complete storage node. In a process, termed as partial repair, a set of storage nodes (among faulty and complete storage nodes) transmit repairing fragments to other faulty storage nodes to recover the lost fragments. We first investigate the optimal partial repair in which the required bandwidth for recovering the lost fragments is minimal. Next, we assume that an eavesdropper wiretaps a subset of links connecting storage nodes, and overhears a number of repairing fragments. We then study optimal secure partial-repair in which the partial-repair bandwidth is minimal and the eavesdropper obtains no information about the source file by overhearing the repairing fragments. We propose optimal secure codes for exact partial-repair in a special scenario.
引用
收藏
页数:5
相关论文
共 50 条
  • [31] Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration
    Yu, Quan
    Shum, Kenneth W.
    Sung, Chi Wan
    2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [32] Optimal-cost repair in multi-hop distributed storage systems with network coding
    Gerami, Majid
    Xiao, Ming
    Skoglund, Mikael
    Shum, Kenneth W.
    Lin, Dengsheng
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2016, 27 (11): : 1539 - 1549
  • [33] An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems
    Zhou, Anan
    Yi, Benshun
    Liu, Yusheng
    Luo, Laigan
    IEEE ACCESS, 2021, 9 : 21843 - 21858
  • [34] A Construction of (5,3) MDS Codes with Optimal Repair Capability for Distributed Storage Systems
    Guan, Sheng
    Kan, Haibin
    Wang, Xin
    2017 9TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP), 2017,
  • [35] Polynomial Length MDS Codes With Optimal Repair in Distributed Storage
    Cadambe, Viveck R.
    Huang, Cheng
    Li, Jin
    Mehrotra, Sanjeev
    2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 1850 - 1854
  • [36] ESSA: An Efficient and Secure Splitting Algorithm for Distributed Storage Systems
    Chen Zhao
    Yao Wenbin
    Xiao Da
    Wu Chunhua
    Liu Jianyi
    Wang Cong
    CHINA COMMUNICATIONS, 2010, 7 (04) : 89 - 95
  • [37] Storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems
    Jingzhao Wang
    Yuan Luo
    Kenneth W. Shum
    Science China Information Sciences, 2020, 63
  • [38] Storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems
    Wang, Jingzhao
    Luo, Yuan
    Shum, Kenneth W.
    SCIENCE CHINA-INFORMATION SCIENCES, 2020, 63 (02)
  • [39] Storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems
    Jingzhao WANG
    Yuan LUO
    Kenneth W.SHUM
    ScienceChina(InformationSciences), 2020, 63 (02) : 131 - 145
  • [40] On the Maintenance of Distributed Storage Systems with Backup Node for Repair
    Calis, Gokhan
    Koyluoglu, O. Ozan
    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016), 2016, : 46 - 50