A resilient distributed protocol for network synchronization
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reverse path forwarding of broadcast packets
Communications of the ACM
A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Local heuristics and the emergence of spanning subgraphs in complex networks
Theoretical Computer Science - Complex networks
Modeling key agreement in multi-hop ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Distributed computation of all node replacements of a minimum spanning tree
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Efficient content-based routing with network topology inference
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
We present a distributed protocol for updating and maintaining a minimum-weight spanning tree (MST) in a network with changing topology. The protocol can respond to multiple link/node failures and recoveries that can occur at arbitrary times. Given that an arbitrary finite number of topological changes occur during a period, the protocol finds the MST corresponding to the latest network, within finite time after the last change. The message complexity of the protocol is O(m|E|+k|V|) when k link recoveries and m link failures occur, where |V| and |E| are the total number of nodes and links, respectively.