Optimal Construction of Regenerating Code Through Rate-Matching in Hostile Networks
Optimal Construction of Regenerating Code Through Rate-Matching in Hostile Networks
复制标题
DOI：
10.1109/tit.2017.2694441
复制
发表时间：
2015-11
影响因子：
2.5
通讯作者：
Jian Li;Tongtong Li;Jian Ren
中科院分区：
文献类型：
--
作者：
Jian Li;Tongtong Li;Jian Ren
再生代码是一类分布式存储代码，它可以最佳地利用每个节点存储的数据量来修复故障节点所需的带宽。在再生折衷曲线上有两个最优点：最小存储再生码和最小带宽再生码。然而，在存储节点可能受损的敌对网络中，网络的存储容量可能会受到显著影响。在本文中，我们提出了两个最佳的再生码结构，通过速率匹配，以打击这种敌对的攻击在敌对的网络。首先，我们开发了一个两层的速率匹配再生码的建设。通过匹配全速率码和部分速率码的参数，我们可以优化整体存储效率，同时保持损坏节点的检测概率。通过综合分析，我们表明，两层速率匹配再生码可以实现70%以上的存储效率比普遍弹性再生码。然后，我们提出了一个最佳的$m$层再生码的建设。虽然原则仍然是相同的两层代码，它的目的是优化总数量的可检测损坏的节点的$m$层的错误可以纠正的约束下，任何给定的代码效率。与具有相同速率的通用弹性再生代码相比，我们的$m$层代码可以检测50%以上的损坏节点。
Regenerating code is a class of distributed storage codes that can optimally trade the bandwidth required to repair a failed node with the amount of data stored per node. There are two optimal points in the regeneration tradeoff curve: the minimum storage regeneration code and the minimum bandwidth regeneration code. However, in hostile networks where the storage nodes may be compromised, the storage capacity of the network can be significantly affected. In this paper, we propose two optimal regenerating code constructions through rate-matching to combat this kind of adversarial attacks in hostile networks. We first develop a two-layer rate-matched regenerating code construction. By matching the parameters of the full rate code and the partial rate code, we can optimize the overall storage efficiency while maintaining the corrupted node detection probability. Through comprehensive analysis, we show that the two-layer rate-matched regenerating code can achieve 70% higher storage efficiency than the universally resilient regenerating code. We then propose an optimal $m$ -layer regenerating code construction. While the principle remains the same as the two-layer code, it is designed to optimize the total number of detectable corrupted nodes of $m$ layers from which the errors can be corrected under the constraint of any given code efficiency. Compared with the universally resilient regenerating code with the same rate, our $m$ -layer code can detect 50% more corrupted nodes.