数据交换问题的有效算法
Efficient Algorithms for the Data Exchange Problem
摘要:
在本文中,我们研究的数据交换问题,一组用户有兴趣获得一个共同的文件,但每个人都只有部分知识,它作为边信息。假设文件被分成数据包,则考虑的辅助信息是文件数据包的线性组合的形式。假设所有用户的集体信息足以恢复整个文件,目标是让每个用户都能访问文件,同时最大限度地减少通信成本。我们假设用户可以通过无噪声广播信道进行通信,并且通信成本是每个用户的成本函数在其传输的比特数上的总和。例如,通信成本可以简单地是需要传输的比特的总数。在本文所研究的最一般的情况下,每个用户可以有任意的凸成本函数。我们提供确定性,多项式时间算法(在用户和数据包的数量),找到一个最佳的通信方案,最大限度地减少通信成本。为了进一步降低复杂度,我们还提出了一个简单的随机算法的启发,我们的确定性算法是基于随机线性网络编码方案。
英文摘要:
In this paper we study the data exchange problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-information considered is in the form of linear combinations of the file packets. Given that the collective information of all the users is sufficient to allow recovery of the entire file, the goal is for each user to gain access to the file while minimizing some communication cost. We assume that users can communicate over a noiseless broadcast channel, and that the communication cost is a sum of each user's cost function over the number of bits it transmits. For instance, the communication cost could simply be the total number of bits that needs to be transmitted. In the most general case studied in this paper, each user can have any arbitrary convex cost function. We provide deterministic, polynomial-time algorithms (in the number of users and packets) which find an optimal communication scheme that minimizes the communication cost. To further lower the complexity, we also propose a simple randomized algorithm inspired by our deterministic algorithm which is based on a random linear network coding scheme.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。