A depth-first search routing algorithm for star graphs and its performance evaluation

Authors:
S. Sur;P. K. Srimani
Affiliations:
Department of Computer Science, Colorado State University Fort Collins, CO 80523, U.S.A.;Department of Computer Science, Colorado State University Fort Collins, CO 80523, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1994

Citing 7
Cited 0

Fault-Tolerant Routing in DeBruijn Comrnunication Networks

IEEE Transactions on Computers
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping

IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Multiprocessor Link and Bus Network Architectures

IEEE Transactions on Computers
Dynamically Restructurable Fault-Tolerant Processor Network Architectures

IEEE Transactions on Computers

Quantified Score

Hi-index	0.98

Visualization

Abstract

A fault-tolerant routing algorithm has been developed for star graph interconnection topology by using a depth-first search strategy. The proposed algorithm routes a message from the source to the destination along an optimal path with a very high probability and is guaranteed to trace a path as long as the source and the destination are not disconnected. We derive exact mathematical expressions for the probabilities that the algorithm will compute an optimal path for a given number of faulty links in the network. The analysis reveals many interesting topological properties of the star graphs.