Efficient Fault-Tolerant Routing Algorithm for OTIS-Cube Using Unsafety Vectors

摘要

For the first time this paper proposes a new fault-tolerant routing algorithm for the well known class of network, OTIS-cube. In this new proposed algorithm, each node A starts by computing the first level unsafely set, s_1~A , composed of the set of unreachable direct neighbours. It then performs m-1 exchanges with its neighbours to determine the k-level unsafely sets S_k~A for all 1 ≤ k ≤ m, where m is an adjustable parameter between 1 and 2n+l. Equipped with these unsafety sets we show how each node calculates numeric unsafety vectors and uses them to achieve efficienl fault-tolerant rouling. The paper presenls also a performance analysis through extensive simulation experiments proving the superiority of the proposed algorithm using the set of unsafety vectors by showing how the deslinalion is reached by using these sets of unsafely vectors. The simulalion results are obtained in terms of rouling dislances and percentage of reachability.