Distributed storage allocations and a hypergraph conjecture of Erdős
Distributed storage allocations and a hypergraph conjecture of Erdős
复制标题
分布式存储分配和 Erdős 的超图猜想
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
T. Ho
中科院分区：
文献类型：
--
作者：
Yi;A. Dimakis;Derek Leong;T. Ho
我们研究了分布式存储分配问题的两种变体。目标是在分布式存储系统中分配给定的存储预算，以最大程度地可靠性。最近发现，此问题与极端组合学中的旧猜想有关，在超图中的最大边数受其最大匹配数受到约束。该猜想最近在某些制度中得到了验证。在本文中，我们假设猜想是真实的，并为各种参数值建立最佳分配结果。我们还得出了独立于猜想的新绩效界限，并将其与以前已知的最佳界限进行比较。
We study two variations of the distributed storage allocation problem. The goal is to allocate a given storage budget in a distributed storage system for maximum reliability. It was recently discovered that this problem is related to an old conjecture in extremal combinatorics, on the maximum number of edges in a hypergraph subject to a constraint on its maximum matching number. The conjecture was recently verified in some regimes. In this paper we assume that the conjecture is true and establish new results for the optimal allocation for a variety of parameter values. We also derive new performance bounds that are independent of the conjecture, and compare them to the best previously known bounds.