Copyright © 1999 Elsevier Science B.V. All rights reserved
Convergence routing on disjoint spanning trees
Available online 24 March 1999.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
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.
Author Keywords: Networks; Local area networks (LAN); Routing; Dynamic routing; Convergence routing; Deflection routing; Disjoint spanning trees; Edge-disjoint spanning trees; Embedding; Ring embedding; Virtual ring embedding; Fault tolerance; Fault coverage; Random graphs
Article Outline
- 1. Introduction
- 2. Virtual rings on two edge-disjoint spanning trees
- 2.1. The network model
- 2.2. Construction of two edge-disjoint spanning trees
- 2.3. A recursive algorithm for 2-tree problem
- 2.4. Choice of topology for the trees
- 3. Convergence routing and computational results
- 3.1. Convergence routing
- 3.2. Controlling the probability of non-default operations
- 3.3. Description of the simulation
- 3.4. Comparison of the embedding structures
- 4. Fault tolerant spanning trees
- 5. Summary







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)




