A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Information Theory and Network Coding
Information Theory and Network Coding
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Network Coding: An Introduction
Network Coding: An Introduction
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Order optimal information spreading using algebraic gossip
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
We use network coding to improve the speed of distributed computation in the dynamic network model of Kuhn, Lynch and Oshman [STOC '10]. In this model an adversary adaptively chooses a new network topology in every round, making even basic distributed computations challenging. Kuhn et al. show that n nodes, each starting with a d-bit token, can broadcast them to all nodes in time O(n2) using b-bit messages, where b d + log n. Their algorithms take the natural approach of token forwarding: in every round each node broadcasts some particular token it knows. They prove matching Ω(n2) lower bounds for a natural class of token forwarding algorithms and an Ω(n log n) lower bound that applies to all token-forwarding algorithms. We use network coding, transmitting random linear combinations of tokens, to break both lower bounds. Our algorithm's performance is quadratic in the message size b, broadcasting the n tokens in roughly d/b2 * n2 rounds. For b = d = Θ(log n) our algorithms use O(n2/log n) rounds, breaking the first lower bound, while for larger message sizes we obtain linear-time algorithms. We also consider networks that change only every T rounds, and achieve an additional factor T2 speedup. This contrasts with related lower and upper bounds of Kuhn et al. implying that for natural token-forwarding algorithms a speedup of T, but not more, can be obtained. Lastly, we give a general way to derandomize random linear network coding, that also leads to new deterministic information dissemination algorithms.