A self-stabilizing algorithm for the bridge-finding problem assuming the distributed demon model

Abstract

A bridge is an edge whose deletion causes a distributed system to become disconnected. Thus bridges are edges critical to distributed system reliability. In this paper, we propose a self-stabilizing algorithm that can find all bridges in a distributed system. Under the as- sumption that a BFS tree have been constructed in the system, our algorithm is self-stabilizing not only un- der the central demon model but also under the more general distributed demon model. The worst-case sta- bilization time of our algorithm under the distributed demon model is at most n2 steps, where n is the num- ber of nodes in the system.