Fault-Tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph

A hyper-star graph HS(2n, n) is promising as a generic topology for interconnection networks of parallel processing systems because it has merits of a hypercube and a star graph. This paper proposes an algorithm that constructs a fault-free path between a pair of non-faulty nodes in HS(2n, n) with faulty nodes. In addition, we conduct a computer experiment to show its effectiveness.