Topology Broadcast Algorithms

Abstract This paper describes efficient distributed algorithms to broadcast network topology to all nodes in a network. They also build minimum depth spanning trees, one rooted at each node. The broadcast of the topology takes place simultaneously with the building of the spanning trees, in a way that insures that each node receives information exactly once. The algorithms are extended to work in presence of link and node failures.