ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Networks
Volume 31, Issue 5, 11 March 1999, Pages 429-443
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (372 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0169-7552(98)00259-1    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1999 Elsevier Science B.V. All rights reserved

Convergence routing on disjoint spanning trees

Bülent Yener1, a, Yoram Ofekb, * and Moti Yung2, c

a Networking and Communication Lab., Department of Computer and Information Sciences, New Jersey Institute of Technology, Newark, NJ 07102-1982, USA b Synchrodyne, Inc., 2600 Netherland Ave., Suite 1921, Riverdale, NY 10463, USA c Certco, 55 Broad St., New York, NY 10017, USA

Available online 24 March 1999.

Purchase the full-text article



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.1.1. Virtual rings
2.1.2. Virtual nodes
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
4.1. Random networks with edge-disjoint spanning trees
4.2. Fault-coverage
5. Summary
References
Vitae








Computer Networks
Volume 31, Issue 5, 11 March 1999, Pages 429-443
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.