A New Fault-Tolerant Routing Algorithm for m-ary n-cube Multi-computers and Its Performance Analysis

Authors:
Liu Hongmei
Affiliations:
College of Science, China Three Gorges University, Hubei Yichang 443002, PRC
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Year:
2007

Citing 4
Cited 0

Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets

IEEE Transactions on Computers
Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths

IEEE Transactions on Parallel and Distributed Systems
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm for fault-tolerant routing based on detour and backtracking techniques is developed for m-ary n-cube multi-computer networks. We analyzed its performance under the condition that when an arbitrary number of components have been damaged and derived some exact expressions for the probability of routing messages via optimal paths from the source node to obstructed node. The probability of routing messages via an optimal path between any two nodes is a special case of our results, and can be obtained by replacing the obstructed node with the destination node.