Design and performance of convergence routing on multiple spanning trees

This paper presents a new design, and a performance study for convergence routing in a general network with multiple spanning trees suggested as a switch-based LAN. In particular, a new algorithm for constructing two edge-disjoint spanning trees of a given network is presented, and the resulting trees are used for convergence routing (a variant of deflection routing with destination convergence guaranteed). It is shown empirically that convergence routing on two edge-disjoint spanning trees yields a better bound than a single spanning tree, on the maximum route length. The construction of the two edge-disjoint spanning trees is done with specific strategies for achieving certain tree properties that improve the system's performance.