Reliable broadcast of routing information using diffusing computations

A distributed algorithm called T-DA is presented. It allows the routing nodes, of a computer network or internet to maintain the correct view of the topology, even when link costs change or the topology changes due to failures or additions of nodes or links. T-DA eliminates the need for flooding by implementing a routing algorithm based on distance vectors to broadcast link-state information reliably over spanning trees that have the shortest distances to the sources of the link-state updates. T-DA eliminates the need for auxiliary information by asking each node to trust the link states reported by the neighbor closest to the source of such information