On the Routing of the OTIS-Cube Network in Presence of Faults

摘要: This paper proposes a new fault-tolerant routing algorithm for the well-known class of networks, OTIS-cube. In this proposed algorithm, each node A starts by computing first level unsafety set, S1 , composed set unreachable direct neighbours. It then performs m-1 exchanges with its neighbours to determine k-level sets Sk all 1 ≤ k m, where m is an adjustable parameter between and 2n + 1. The at represents faulty nodes Hamming distance from A, which either or due links. Equipped these sets, we show how calculates numeric vectors uses them achieve efficient fault- tolerant routing.