Fault Tolerant Routing Algorithm for OTIS-2D-Torus Interconnection Networks

JEHAD AHMED, AL SADI (2018) Fault Tolerant Routing Algorithm for OTIS-2D-Torus Interconnection Networks. In: Sixth International Conference on Advances in Computing, Communication and Information Technology - CCIT 2018, 28-29 April, 2018, Zurich, Switzerland.

[img]
Preview
Text
20180505_092220.pdf - Published Version

Download (647kB) | Preview
Official URL: https://www.seekdl.org/conferences/paper/details/9...

Abstract

This paper proposes an enhanced fault-tolerant routing algorithm for the OTIS-2D-tours interconnection network,. Many researchers work have been presented on the Torus related topics, but not often research addressed the OTISTorus. In the proposed algorithm, each node A starts by computing the first level unsafety set, , composed of the set of unreachable direct neighbours within the OTIS-2D-tours topology. It then performs m-1 exchanges with its neighbours to determine the k-level unsafety sets for all 1 ï‚£ k ï‚£ m, where m is an adjustable parameter between 1 and 2n+1; diameter of the network. The k-level unsafety set at node A represents the set of all faulty nodes at Hamming distance k from A which either faulty or unreachable from A due to faulty nodes or links. Equipped with these unsafety sets we show how each node calculates numeric unsafety vectors and uses them to achieve efficient fault-tolerant routing for the OTIS-2D-tours.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Interconnection Networks, OTIS-2D-Torus, FaultTolerant Routing Algorithm, Unsafety Vectors
Depositing User: Mr. John Steve
Date Deposited: 08 Mar 2019 14:53
Last Modified: 08 Mar 2019 14:53
URI: http://publications.theired.org/id/eprint/184

Actions (login required)

View Item View Item