Issue No. 03 - March (1999 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.755820
<p><b>Abstract</b>—The problem of tolerating faulty nodes in hypercubes has been studied by many researchers either by using spares or by reconfiguration. In this paper, algorithms for tolerating faulty nodes and links in hypercubes are presented. The algorithms are based on using general spanning trees (GST), complete unbalanced spanning trees (CUST), and balanced spanning trees (BST) for reconfiguring the hypercube to avoid faulty nodes and links. The algorithms contain two phases: The first phase involves the construction of the spanning tree and the second one is for reconfiguring the hypercube should a faulty node be detected. The reconfiguration process consists of two basic steps. First, the faulty node is disconnected from the spanning tree. Then, a new spanning tree is constructed by reconnecting the children of the faulty node to the spanning tree. One hundred percent single fault correction (avoidance) and almost 100 percent fault correction (avoidance) of double and triple faults are achieved by the proposed algorithms for hypercubes having a dimension of <it>n</it>≥ 6. Simulation results for the algorithm under more than three faults also are presented. For any <it>k</it> faulty nodes (1 ≤<it>k</it>≤ 2<super><it>n</it></super>− 1), the reconfiguration algorithm may be applied <it>k</it> times to avoid these <it>k</it> faulty nodes as long as no combination of any two of the faults results in a blocking situation. The proposed reconfiguration algorithms tolerate all possible single-link faults. The reconfiguration algorithms are extended to tolerate (<it>k</it>≤<it>n</it>− 1) multiple faults, causing blocking situation, with a backtracking.</p>
Fault tolerance, spanning trees, reconfiguration, faulty hypercubes, single and multiple faults.
D. R. Avresky and K. Al-Tawi, "Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes," in IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 211-222, 1999.