摘要：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).
关键词：Fault-tolerant routing; Injured and regular tree-hypercube; hypercube
