A Fault-tolerant Routing Algorithm using Directed Probabilities in Hypercube Networks
نویسندگان
چکیده
In this paper, we propose a new fault-tolerant routing algorithm for hypercube networks based on directed probabilities. The directed probabilities are obtained by improving the probabilities proposed by Al-Sadi et al. The probability represents ability of routing to any node at a specific distance. Each node selects one of its neighbor nodes to send a message by taking the probabilities into consideration. We also conducted a computer experiment to verify the effectiveness of our algorithms.
منابع مشابه
Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes
Recently, parallel processing systems have been studied very actively, and many topologies have been proposed. A hypercube is one of the most popular topologies for interconnection networks. In this paper, we propose two new fault-tolerant routing algorithms for hypercubes based on approximate directed routable probabilities. The probability represents ability of routing to any node at a specif...
متن کاملFault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks
Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. One of the most popular topologies is a hypercube network. In this paper, we propose new fault-tolerant routing algorithms for hypercube networks based on approximate routable probabilities. The probability represents ability of routing to any node at a specific distance. Each node ...
متن کاملA Case Study of Fault Tolerant Routing Mechanism for Torus Embedded Hypercube Interconnection Network for Parallel Architecture
This paper describes a fault-tolerant routing mechanism to facilitate data routing in Torus embedded hypercube interconnection network subject to node failures in parallel computing. It is shown that by only using feasible paths routing can be substantially simplified. Though there are algorithms for fault tolerant communication in torus and hypercube networks, there exits no efficient algorith...
متن کاملA Novel Optimal Routing and A Fault-Tolerant Routing for the Incrementally Extensible Hypercube Network
The incrementally extensible hypercube (IEH) network, a variant of the hypercube, is defined for every positive number and has been widely discussed. However, some properties of the IEH network are incorrect and have been misused. Moreover, no deterministic fault-tolerant routing has been proposed. In this paper, we first simplify the construction of an IEH network. Then we point out the mistak...
متن کاملOptimal Core Selection for Multicast Tree Routing in Hypercube Networks
This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube networks using shared tree routing approach. The algorithms can select an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient as compared with the existing multicast algori...
متن کامل