Storage Capacity of Repairable Networks
Storage Capacity of Repairable Networks
复制标题
可修复网络的存储容量
DOI：
--
复制
发表时间：
2014
影响因子：
2.5
通讯作者：
A. Mazumdar
中科院分区：
文献类型：
--
作者：
A. Mazumdar
在本文中，我们引入了一个分布式存储系统的模型，该模型可以从任何单个服务器故障中进行本地恢复。与分布式存储代码的通常本地恢复模型不同，该模型考虑了这样一个事实，即网络中的每个服务器或存储节点只能连接到一些节点，而不是所有其他节点。这可能是由于物理分离、存储平台中的非同质性等原因造成的。在此模型下，我们估计了无向网络和有向网络的存储容量，并提出了一些建设性的方案。从编码理论的角度来看，我们证明了这个模型近似对偶的索引编码问题已经得到了很好的研究。此外，在本文中，我们扩展了上述模型来处理多个服务器故障。在其他结果中，我们提供了具有局部修复保证的图中可以存储的一组词的最小成对距离的上界。我们的结果给出了众所周知的局部可恢复码距离的不可能界。
In this paper, we introduce a model of a distributed storage system that is locally recoverable from any single server failure. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that each server or storage node in a network is connectable to only some, and not all other, nodes. This may happen for reasons such as physical separation, inhomogeneity in storage platforms, and so forth. We estimate the storage capacity of both undirected and directed networks under this model and propose some constructive schemes. From a coding theory point of view, we show that this model is approximately dual of the well-studied index coding problem. Furthermore, in this paper, we extend the above model to handle multiple server failures. Among other results, we provide an upper bound on the minimum pairwise distance of a set of words that can be stored in a graph with the local repair guarantee. The well-known impossibility bounds on the distance of locally recoverable codes follow from our result.