Unsafety vectors: A new fault-tolerant routing for k-ary n-cubes

K-ary n-cubes have been one of the most common networks for multicomputers due to their desirable properties, such as ease of implementation and ability to exploit communication locality found in many parallel applications. This paper presents a new fault-tolerant routing algorithm for k-ary n-cubes. The algorithm is based on the concept of 'unsafety vectors', which measures the 'degree' of unsafety to reach a given destination node. Extensive simulation reveals that for practical number of faulty nodes, the proposed fault-tolerant routing algorithm achieves good performance in terms of the routing distance and percentage of reachability.