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

基于MDS码的协同数据交换

Cooperative Data Exchange based on MDS Codes

Su Li, Michael Gastpar

摘要:

研究了全连通网络中的协作数据交换问题。在这个问题中,每个节点最初只拥有组成文件的$K$数据包的一个子集。节点进行由所有其他节点接收的广播传输。目标是让每个节点恢复完整的文件。在本文中,我们提出了一个多项式时间确定性算法来计算最优(即,最小)数量的所需广播传输,并确定要由节点进行的精确传输。我们的方法的一个特别的特点是,{\it每}的$K-d$传输是一个线性组合的{\it正好} $d+1$数据包,我们展示了如何最佳地选择值的$d.$我们还展示了如何利用连接到最大距离可分离(MDS)码这些线性组合的系数可以选择。此外,我们表明,我们的方法可以用来解决合作数据交换问题的加权成本,以及所谓的连续的本地全知问题。

英文摘要:

The cooperative data exchange problem is studied for the fully connected network. In this problem, each node initially only possesses a subset of the $K$ packets making up the file. Nodes make broadcast transmissions that are received by all other nodes. The goal is for each node to recover the full file. In this paper, we present a polynomial-time deterministic algorithm to compute the optimal (i.e., minimal) number of required broadcast transmissions and to determine the precise transmissions to be made by the nodes. A particular feature of our approach is that {\it each} of the $K-d$ transmissions is a linear combination of {\it exactly} $d+1$ packets, and we show how to optimally choose the value of $d.$ We also show how the coefficients of these linear combinations can be chosen by leveraging a connection to Maximum Distance Separable (MDS) codes. Moreover, we show that our method can be used to solve cooperative data exchange problems with weighted cost as well as the so-called successive local omniscience problem.

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

↑