单向环网络上数据存储问题的研究

Research on Distributed Storage Problems over Unidirectional Ring Networks

研究了单向环网络上的数据存储问题,得到了每个用户重构全部原始数据的带宽下界,并由此定义了最优重构分布存储方案.接着讨论了最优重构分布存储系统中损坏节点的修复问题,得到了修复一个损坏节点所需带宽的紧的下界.进一步指出在最优重构分布存储系统中,每个损坏节点都能够用最优带宽进行修复.特别地,给出了一个新颖的基于欧几里得除法的最优构造方法.

The problem of data storage over unidirectional ring networks is discussed.A lower bound on reconstructing bandwidth for each user to reconstruct the total original data is proposed,and the optimal reconstructing distributed storage scheme(ORDSS)is defined.Then the repair problem of a failed storage node in ORDSSes is discussed and a tight lower bound on repair bandwidth is obtained.Furthermore,it indicates that for any ORDSS,every failed storage node can be repaired with the optimal bandwidth.Particularly,a novel optimal construction method is presented based on Euclidean division.