Research Article Open Access

Adaptive Fault Tolerant Routing Algorithm for Tree-Hypercube Multicomputer

Qatawneh Mohammad1
  • 1 ,
Journal of Computer Science
Volume 2 No. 2, 2006, 124-126

DOI: https://doi.org/10.3844/jcssp.2006.124.126

Submitted On: 8 September 2005 Published On: 28 February 2006

How to Cite: Mohammad, Q. (2006). Adaptive Fault Tolerant Routing Algorithm for Tree-Hypercube Multicomputer. Journal of Computer Science, 2(2), 124-126. https://doi.org/10.3844/jcssp.2006.124.126

Abstract

A Connected tree-hypercube with faulty links and/or nodes is called injured tree-hypercube. To enable any non faulty node to communicate with any other non faulty node in an injured tree-hypercube, the information on component failures has to be made available to non faulty nodes to route message around the faulty components. We proposed an adaptive fault tolerant routing algorithm for an injured tree-hypercube in which requires each node to know only the condition of it’s own links. This routing algorithm is shown to be capable of routing messages successfully in an injured tree-hypercube as long as the number of faulty components links and/or nodes is equal d (depth).

  • 998 Views
  • 1,434 Downloads
  • 3 Citations

Download

Keywords

  • Fault-tolerant routing
  • Injured and regular tree-hypercube
  • hypercube