Complexity of network synchronization
Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
A protocol to maintain a minimum spanning tree in a dynamic topology
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
Hi-index | 0.00 |
We present a resilient distributed protocol that enables a synchronous algorithm to run on an asynchronous network. The protocol is resilient in the sense that it can continue providing network synchronization in the presence of topological changes in the underlying communication network of a distributed system. These changes are caused by link/node failures and recoveries that occur while running the protocol. In general, the protocol is a useful tool in the design of resilient distributed algorithms as it isolates the algorithm from the characteristics of the communication network.