This paper presents a new design and a performance study for convergence routing in a general network with multiple spanning trees. Such an arbitrary topology network is used in the design of a switch-based LAN/MAN architecture. Convergence routing can be viewed as a variant of deflection routing which combines, in a dynamic fashion, the on-line routing decision with the traffic load inside network. However, unlike other deflection techniques, convergence routing guarantees that packets will reach (or converge) to their destinations.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. 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 improving the fault-tolerance and performance of the system.