最小化数据读取和下载以实现多节点恢复
On Minimizing Data-read and Download for Storage-Node Recovery
摘要:
我们考虑的问题,有效地恢复存储在任何单个节点的分布式存储系统中的数据,从其余的节点。应用包括处理故障和降级读取。我们根据数据读取量和所需下载量来衡量效率。为了最大限度地减少下载,我们专注于分布式存储的“再生代码”模型的最小带宽设置。在该模型下,系统总共有n个节点,并且存储在任何节点中的数据都必须可以从其他(n-1)个节点中的任何d个节点(有效地)恢复。在此模型下的两个度量的下限之前已经推导出;还已经表明,当d=n-1时,这些界限对于数据读取和下载的量是可实现的,并且当d<n-1时,这些界限对于单独的下载量是可实现的。在本文中,我们通过证明相反的结果来完成这幅图,即当d<n-1时,这些下限相对于所需的读取量是严格宽松的。这个证明是信息论的,因此也适用于非线性码。我们还表明,根据两个(实际)放松的问题设置,这些下限可以同时满足读取和下载。
英文摘要:
We consider the problem of efficient recovery of the data stored in any individual node of a distributed storage system, from the rest of the nodes. Applications include handling failures and degraded reads. We measure efficiency in terms of the amount of data-read and the download required. To minimize the download, we focus on the minimum bandwidth setting of the 'regenerating codes' model for distributed storage. Under this model, the system has a total of n nodes, and the data stored in any node must be (efficiently) recoverable from any d of the other (n-1) nodes. Lower bounds on the two metrics under this model were derived previously; it has also been shown that these bounds are achievable for the amount of data-read and download when d=n-1, and for the amount of download alone when d<n-1. In this paper, we complete this picture by proving the converse result, that when d<n-1, these lower bounds are strictly loose with respect to the amount of read required. The proof is information-theoretic, and hence applies to non-linear codes as well. We also show that under two (practical) relaxations of the problem setting, these lower bounds can be met for both read and download simultaneously.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。