On Calculating the Minimum Rate for the Cooperative Data Exchange Problem Over Fully Connected Networks.
In: IEEE Transactions on Communications, Jg. 69 (2021-09-01), Heft 9, S. 5817-5827
Online
academicJournal
Zugriff:
We study the cooperative data exchange problem for fully connected networks. In this problem, nodes make broadcast transmissions to recover a file consisting of $K$ independent packets. Each node initially only possesses a subset of the packets. We propose $(d,K)$ -Basis Searching, a deterministic polynomial-time minimization approach, to calculate the minimum rate for this problem. $(d,K)$ -Basis Searching has strictly reduced complexity compared with the state-of-the-art algorithms, which are based on submodular function minimization. We extend our algorithm to a generalized problem: the so-called successive local omniscience problem. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
On Calculating the Minimum Rate for the Cooperative Data Exchange Problem Over Fully Connected Networks.
|
---|---|
Autor/in / Beteiligte Person: | Li, Su ; Gastpar, Michael |
Link: | |
Zeitschrift: | IEEE Transactions on Communications, Jg. 69 (2021-09-01), Heft 9, S. 5817-5827 |
Veröffentlichung: | 2021 |
Medientyp: | academicJournal |
ISSN: | 0090-6778 (print) |
DOI: | 10.1109/TCOMM.2021.3088527 |
Schlagwort: |
|
Sonstiges: |
|