Affiliation:
1. Johns Hopkins University, Baltimore, Maryland
2. Technion, Haifa, Israel
Abstract
In this article, we show that keeping track of history enables significant improvements in the communication complexity of dynamic network protocols. We present a communication optimal maintenance of a spanning tree in a dynamic network. The amortized (on the number of topological changes) message complexity is
O
(
V
), where
V
is the number of nodes in the network. The message size used by the algorithm is
O
(log |ID|) where |ID| is the size of the name space of the nodes. Typically, log |ID| =
O
(log
V
).
Previous algorithms that adapt to dynamic networks involved Ω (
E
) messages per topological change—inherently paying for re-computation of the tree from scratch.
Spanning trees are essential components in many distributed algorithms. Some examples include
broadcast
(dissemination of messages to all network nodes),
multicast, reset
(general adaptation of static algorithms to dynamic networks), routing,
termination detection
, and more. Thus, our efficient maintenance of a spanning tree implies the improvement of algorithms for these tasks. Our results are obtained using a novel technique to save communication. A node uses information received in the past in order to deduce present information from the fact that certain messages were NOT sent by the node's neighbor. This technique is one of our main contributions.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference72 articles.
1. Applying static network protocols to dynamic networks
2. Slide—The Key to Polynomial End-to-End Communication
3. Afek Y. Awerbuch B. and Moriel H. 1989. Overhead of resetting a communication protocol is independent of the size of the network. (May) Unpublished manuscript. Afek Y. Awerbuch B. and Moriel H. 1989. Overhead of resetting a communication protocol is independent of the size of the network. (May) Unpublished manuscript.
4. End-to-end communication in unreliable networks
5. Bootstrap network resynchronization (extended abstract)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Input-Dynamic Distributed Algorithms for Communication Networks;ACM SIGMETRICS Performance Evaluation Review;2021-06-22
2. Input-Dynamic Distributed Algorithms for Communication Networks;Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems;2021-05-31
3. Input-Dynamic Distributed Algorithms for Communication Networks;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2021-02-18
4. Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs;ACM Transactions on Parallel Computing;2019-12-05
5. Maintaining a Distributed Spanning Forest in Highly Dynamic Networks;The Computer Journal;2018-07-11