Fault-tolerant routing in the star graph

We present a fault tolerant routing algorithm for the star graph. The algorithm is based on the concept of unsafety vectors originally proposed for binary n-cubes [J. Al-Sadi et al., (2002)]. Each node starts by computing a first level unsafely set, composed of the set of unreachable neighbours. lt then performs some exchanges with its neighbours to determine the unsafely nodes. After that all of the nodes have the addresses of all faulty nodes. Based on the information gathered in each node. Fault-tolerant routing between a source node and a destination node is realised.