arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.4310cs.ITmath.IT
收藏

单向环形网络上的分布式存储

Distributed Storage over Unidirectional Ring Networks

Jiyong Lu, Xuan Guang, Fang-Wei Fu

摘要:

本文研究了单向环形网络上的分布式存储问题,其存储节点构成一个有向环,数据沿同一方向传输。原始数据被分布存储在这些节点上。每个用户只能连接一个存储节点来下载全部数据。给出了每个用户恢复原始数据所需的重构带宽的一个下界,该下界对于任意参数都是可实现的。如果一个分布式存储方案能够达到这个下限,并且每个用户都是平等的,我们称之为最优重构分布式存储方案(ORDSS)。此外,一个失败的存储节点在ORDSSes的修复问题正在考虑和修复带宽上的一个紧的下界。特别是,我们指出的事实,对于任何的ORDSS,每个存储节点可以修复修复带宽达到下限与平等。此外,我们提出了两种结构的任意参数的ordss,称为MDS建设和ED建设,分别。特别是,ED构造,通过使用欧几里德划分的概念,是更有效的,通过我们的详细分析。

英文摘要:

In this paper, we study distributed storage problems over unidirectional ring networks, whose storage nodes form a directed ring and data is transmitted along the same direction. The original data is distributed to store on these nodes. Each user can connect one and only one storage node to download the total data. A lower bound on the reconstructing bandwidth to recover the original data for each user is proposed, and it is achievable for arbitrary parameters. If a distributed storage scheme can achieve this lower bound with equality for every user, we say it an optimal reconstructing distributed storage scheme (ORDSS). Furthermore, the repair problem for a failed storage node in ORDSSes is under consideration and a tight lower bound on the repair bandwidth is obtained. In particular, we indicate the fact that for any ORDSS, every storage node can be repaired with repair bandwidth achieving the lower bound with equality. In addition, we present two constructions for ORDSSes of arbitrary parameters, called MDS construction and ED construction, respectively. Particularly, ED construction, by using the concept of Euclidean division, is more efficient by our analysis in detail.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑