论文标题
Treeplication：在随机多频道下的分布式完整恢复的擦除代码
Treeplication: An Erasure Code for Distributed Full Recovery under the Random Multiset Channel
论文作者
论文摘要
本文介绍了一种新的擦除代码，称为Treeplication，旨在分布式恢复完整信息单词，而大多数先前用于分布式存储的工作仅支持单个符号的分布式维修。 $ k $信息符号的treeplication代码定义在带有$ 2K-1 $顶点的二进制树上，以及从树层中选择代码符号的分发。我们在随机模型下分析和优化代码，该模型捕获可恢复的节点的系统属性，从存储代码符号的节点随机绘制。 treeplication代码显示具有与复制相当的完全恢复通信成本，同时提供了更好的可恢复性。
This paper presents a new erasure code called Treeplication designed for distributed recovery of the full information word, while most prior work in coding for distributed storage only supports distributed repair of individual symbols. A Treeplication code for $k$ information symbols is defined on a binary tree with $2k-1$ vertices, along with a distribution for selecting code symbols from the tree layers. We analyze and optimize the code under a random-multiset model, which captures the system property that the nodes available for recovery are drawn randomly from the nodes storing the code symbols. Treeplication codes are shown to have full-recovery communication-cost comparable to replication, while offering much better recoverability.
