arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.1666cs.ITcs.DCcs.NImath.IT
收藏

存储网络中不经意更新通信的基本限制

Fundamental Limits on Communication for Oblivious Updates in Storage Networks

Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi

摘要:

在分布式存储系统中,存储节点由于多种原因间歇性地离线。在重新联机时,节点需要更新其内容,以反映在此期间对数据的任何修改。在本文中,我们考虑一个设置,其中没有修改的数据需要记录在系统中的信息。在这样的设置中,“陈旧”节点需要通过从已经更新的节点下载数据来更新其内容,而陈旧节点和更新的节点都不知道哪些数据符号被修改以及它们的值是什么。我们调查的基本限制,这样一个“不经意”的更新过程所需的通信量。我们首先提出了一个通用的通信量的下限,这是必要的任何存储代码下的线性编码(同时允许非线性更新协议)。这个下界是在一组非常弱的条件下导出的,所有更新的节点都可以访问整个修改的数据,而旧节点可以访问整个旧数据作为辅助信息。然后,我们提出的代码和更新算法是最佳的,因为它们满足这个下限。接下来,我们提出了一个下界的一个重要子类的代码,即线性最大距离可分(MDS)码。然后,我们提出了一个MDS码的建设和相关的更新算法,满足这个下限。因此,这些结果建立在这些设置下的通信要求方面的不经意更新的能力。

英文摘要:

In distributed storage systems, storage nodes intermittently go offline for numerous reasons. On coming back online, nodes need to update their contents to reflect any modifications to the data in the interim. In this paper, we consider a setting where no information regarding modified data needs to be logged in the system. In such a setting, a 'stale' node needs to update its contents by downloading data from already updated nodes, while neither the stale node nor the updated nodes have any knowledge as to which data symbols are modified and what their value is. We investigate the fundamental limits on the amount of communication necessary for such an "oblivious" update process. We first present a generic lower bound on the amount of communication that is necessary under any storage code with a linear encoding (while allowing non-linear update protocols). This lower bound is derived under a set of extremely weak conditions, giving all updated nodes access to the entire modified data and the stale node access to the entire stale data as side information. We then present codes and update algorithms that are optimal in that they meet this lower bound. Next, we present a lower bound for an important subclass of codes, that of linear Maximum-Distance-Separable (MDS) codes. We then present an MDS code construction and an associated update algorithm that meets this lower bound. These results thus establish the capacity of oblivious updates in terms of the communication requirements under these settings.

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

↑