Adaptive Fault Tolerant Routing in Star Graph

Abstract

Translate Article

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.