Probability-based Fault-tolerant Routing in Hypercubes

@article{AlSadi2001ProbabilitybasedFR,
  title={Probability-based Fault-tolerant Routing in Hypercubes},
  author={Jehad Al-Sadi and Khaled Day and Mohamed Ould-Khaoua},
  journal={Comput. J.},
  year={2001},
  volume={44},
  pages={368-373}
}
This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. To compute these vectors, a node first determines its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the kth element represents the probability that a destination node at distance k cannot be reached through a minimal path due to a faulty node… 

Figures and Tables from this paper

A Fault-Tolerant Routing Algorithm for 3-D Torus Interconnection Networks

An extensive performance evaluation reveals that the proposed algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachability and routing distances.

A new probabilistic approach for fault-tolerant routing in k-ary n-cubes

The proposed algorithm exhibits good fault-tolerance properties in terms of the achieved average routing distances and an extensive performance analysis for the new algorithm is conducted.

Fault-tolerant routing based on approximate directed routable probabilities for hypercubes

An efficient fault tolerant routing algorithm for binary cube interconnection networks

This paper presents a fault tolerant routing algorithm for injured hypercube that backtracks from the faulty nodes using stacks of passed nodes embedded in the header of messages and efficiently works with any number of faulty nodes in the network.

Link-Fault-Tolerant routing in folded hypercube using directed routing probability

  • Lam Boi NgocK. Kaneko
  • Computer Science
    2017 6th ICT International Student Project Conference (ICT-ISPC)
  • 2017
This paper proposes a link-fault-tolerant routing algorithm in folded hypercube based on directed routing probabilities, which represents the routing ability of a vertex for an arbitrary vertex at a specific distance.

A Fault-tolerant Routing Algorithm using Directed Probabilities in Hypercube Networks

A new fault-tolerant routing algorithm for hypercube networks based on directed probabilities that represents ability of routing to any node at a specific distance is proposed.

A Stochastic Fault-tolerant Routing Algorithm in Hyper-star Graphs

An O(n log n) algorithm that constructs a faultfree path between a pair of non-faulty nodes in HS(2n, n) with faulty nodes is proposed.

Fault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks

This paper proposes new fault-tolerant routing algorithms for hypercube networks based on approximate routable probabilities, which represents ability of routing to any node at a specific distance.

Fault-Tolerant Routing Based on Safety Path Vectors in Hypercube System

An innovative fault-tolerant routing algorithm is proposed, in which each node uses a safety path vector (SPV) to record the optimal paths to the other nodes, which has stronger ability in tracing optimal paths with equal or less storage cost.

Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks

The proposed routing methodology efficiently tolerates any pattern of faulty regions with any number of faulty nodes in the network which is based on the best-first search and backtracking strategy and guarantees delivery of messages between any pair of source and destination while the network is connected.

References

SHOWING 1-10 OF 30 REFERENCES

Fault-tolerant routing strategy using routing capability in hypercube multicomputers

The concept of routing capability, which is defined with respect to the entire spectrum of distance, is proposed to assist routing function and the amount of information that is useful for message routing is increased with the proposed scheme.

A Fault-Tolerant Routing Strategy in Hypercube Multicomputers

Another fault-tolerant routing algorithm, which requires only a constant of five virtual networks in wormhole routing to ensure the property of deadlock freeness for a hypercube of any size, is presented in this research.

A Fault-Tolerant Communication Scheme for Hypercube Computers

A fault-tolerant communication scheme that facilitates near-optimal routing and broadcasting in hypercube computers subject to node failures is described and it is shown that by only using 'feasible' paths that try to avoid unsafe nodes, routing and Broadcasting can be substantially simplified.

Depth-First Search Approach for Fault-Tolerant Routing in Hypercube

Using depth-first search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an

Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

A distributed adaptive fault-tolerant routing scheme is proposed for an injured hypercube in which each node is required to know only the condition of its own links and is shown to be capable of routing messages successfully in an injured n-dimensional hypercube as long as the number of faulty components is less than n.

Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

  • Jie Wu
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1998
Reliable communication in cube-based multicomputers using the safety vector concept is studied, representing the ability of a routing algorithm to dynamically adjust its routing adaptivity based on fault distribution in the neighborhood.

Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers

The concept of directed routing capability which contains more useful information for fault-tolerant routing is introduced and the amount of information that is useful for message routing is increased.

Hypercube message routing in the presence of faults

This paper considers the basic problem of routing a single message from an arbitrary source to an arbitrary destination, and shows that the a priori probability of successful message routing is high even for an exceedingly large number of faults.

Reliable Unicasting in Faulty Hypercubes Using Safety Levels

  • Jie Wu
  • Computer Science
    IEEE Trans. Computers
  • 1997
The proposed scheme is the first attempt to address the unicasting problem in disconnected hypercubes by using the safety level concept, which is also extended to be used inHypercubes with both faulty nodes and links and in generalizedhypercubes.

Fault-Tolerant Communication Algorithms in Toroidal Networks

Non-redundant fault-tolerant communication algorithms for faulty k-ary n-cubes are introduced. These include: one-to-all broadcasting, all-to-all broadcasting, one-to-all personalized communication