Abstract
This paper presents 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 [Unsafety vectors: a new Fault-Tolerant Routing for the Binary n-cube]. Each node starts by computing a first level unsafety set, composed of the set of unreachable neighbours. It then performs some exchanges with its neighbours to determine the unsafety nodes. After that all of the nodes have the addresses of all faulty nodes. Based on the information gathered in each node, fault-tolearnt routing between a source node and a destination node is raelised.