Optimal MDS codes for cooperative repair
Optimal MDS codes for cooperative repair
复制标题
协作修复的最佳 MDS 代码
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
A. Barg
中科院分区：
文献类型：
--
作者：
Min Ye;A. Barg
分布式存储系统中多节点修复的两种被广泛研究的模型是集中式修复和协作式修复。集中式模型假定所有故障节点在一个位置重新创建，而协作式模型规定故障节点可以通信但相互独立，并且它们之间交换的数据量包含在修复带宽中。我们提出了两类具有最优协作修复的$(n,k)$MDS码。第一类码对于任何给定的$k\leq d\leq n - 2$，支持从任何$d$个辅助节点对任意两个擦除进行最优修复。第二类码对于任何$2\leq h\leq n - k - 1$，支持从任何$k + 1$个辅助节点对任意$h$个故障节点进行最优修复。
Two widely studied models of multiple-node repair in distributed storage systems are centralized repair and cooperative repair. The centralized model assumes that all the failed nodes are recreated in one location, while the cooperative one stipulates that the failed nodes may communicate but are distinct, and the amount of data exchanged between them is included in the repair bandwidth. We present two families of $(n,k)$ MDS codes with optimal cooperative repair. Codes in the first family support optimal repair of any two erasures from any $d$ helper nodes for any given $kle dle n-2.$ Codes in the second family support optimal repair of any $h$ failed nodes, $2le hle n-k-1,$ from any $k+1$ helper nodes.
DOI：
10.1109/allerton.2017.8262840
发表时间：
2017-10
期刊：
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
影响因子：
--
作者：
Ameera Chowdhury;A. Vardy
通讯作者：
Ameera Chowdhury;A. Vardy