Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors

Abstract

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 unsafety set, SA1, composed of the set of unreachable direct neighbours. It then performs m-1 exchanges with its neighbours to determine the k-level unsafety sets SAk for all 1 ≤ k ≤ m, where m is an adjustable parameter between 1 and 2n+1. Equipped with these unsafety sets we show how each node calculates numeric unsafety vectors and uses them to achieve efficient fault-tolerant routing. The paper presents 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 destination is reached by using these sets of unsafety vectors. The simulation results are obtained in terms of routing distances and percentage of reachability.