Topological Properties of Hypercubes
IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Embedding meshes on the star graph
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Topological Properties of OTIS-Networks
IEEE Transactions on Parallel and Distributed Systems
Unsafety vectors: a new fault-tolerant routing for the binary n-cube
Journal of Systems Architecture: the EUROMICRO Journal
Algorithms for the otis optoelectronic computer
Algorithms for the otis optoelectronic computer
OTIS-star an attractive alternative network
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
| Hi-index | 0.00 |
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.