A dynamic self-stabilizing algorithm for constructing a transport net
A self-stabilizing algorithm is presented in this paper that constructs a transport net corresponding to an undirected biconnected graph on a distributed or network model of computation. The algorithm is resilient to transient faults and does not require initialization. In addition, it is capable of handling topology changes in a transient manner. The paper includes a correctness proof of the algorithm. Finally, it concludes with some final remarks.
self-stabilization transport net biconnected graph distributed systems