A performance guaranteed new algorithm for fault-tolerant routing in folded cubes

Authors:
Liu Hongmei
Affiliations:
College of Science, Three Gorges University, Hubei Yichang, PRC
Venue:
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Year:
2007

Citing 6
Cited 0

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computing (2nd ed.): theory and practice

Parallel computing (2nd ed.): theory and practice
Embedding Hamiltonian cycles into folded hypercubes with faulty links

Journal of Parallel and Distributed Computing
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Complete binary trees in folded and enhanced cubes

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In folded cube computer network, we developed a new algorithm for fault-tolerant routing which is based on detour and backtracking techniques. Its performance is analyzed in detail in the presence of an arbitrary number of components being damaged and derived some exact expressions for the probability of routing messages via optimal paths from the source 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. It is also showed that in the presence of component failures this algorithm can route messages via an optimal path to its destination with a very high probability.