Fault-tolerant routing in a locally twisted cube

Abstract

A locally twisted cube is one of the promising topologies for interconnection networks of parallel computers. In this paper, we propose a fault-tolerant routing algorithm in a locally twisted cube with faulty nodes. The algorithm uses the limited global information called routing capabilities. Moreover, we conducted a computer experiment to evaluate the performance of our algorithm.