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(+l+klW h w en k link recoveries and m link failures occur, where IV1 and [El are the total number of nodes and links, respectively.

No abstract

Resilient protocols for spanning tree problems have been designed on an individual basis in the past. We p r o p an alternative method to design resilient protocols for these problems. The method consists of a generic resilient protocol that can be employed for any spanning tree problem. A resilient protocol for a particular spanning tree problem can be obtained by adjusting various run-time parameters of the generic protocol. The protocols obtained with this method are efficient and easy to implement and verify because they are all derived from the generic protocol.

No abstract

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.