Adaptive fault tolerant routing in star graph

Authors:
Rajib K. Das
Affiliations:
Tezpur University, Tezpur, Assam, India
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 5
Cited 1

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Routing function and deadlock avoidance in a star graph interconnection network

Journal of Parallel and Distributed Computing
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

IEEE Transactions on Parallel and Distributed Systems
A Routing and Broadcasting Scheme on Faulty Star Graphs

IEEE Transactions on Computers
Reliable Communication in Faulty Star Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

Substar Reliability Analysis in Star Networks

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a fault tolerant routing algorithm on star graph is proposed. Each node in an n-star is associated with a fault-vector of d=$\lceil \frac{3(n-1)}{2} \rceil$bits, which is an approximate measure of the number and distribution of faults in the neighborhood. The routing algorithm based on the fault-vector finds the shortest path between any source-destination pair in presence of large number of faulty nodes or links. Simulation results show that the % of cases where the algorithm fails to find a shortest path even when a shortest path exists, is as low as 2.7 with 140 node or link faults in a 7-star.