Abstract
Optimal algorithms to construct 1-fault-tolerant structures were presented with examples of simple and diagonal grids and torus based on algorithm A2 discussed in the first part of the paper. The general procedure of constructing the k-fault-tolerant structures was presented first for a simple cycle and then for more involved grid graphs. Algorithms for reconfiguration after failure were described. For the 1-fault-tolerant structures, these algorithms are realized as a simple table of automorphisms of the fault-tolerant graph. For the case of k-fault-tolerance, correct reconfiguration requires symmetrization of the reduced graph after the ith failure by elimination of the redundant connections introduced to improve fault-tolerance from i - 1 to i when constructin the k-fault-tolerant system graph.
Similar content being viewed by others
REFERENCES
Karavai, M.F., Minimized Embedding of Arbitrary Hamiltonian Graphs in Fault-tolerant Graph and Reconfiguration at Faults. I. One-fault-tolerant Structures, Avtom. Telemekh., 2004, no. 12, pp. 159–178.
Karavai, M.F., An Invariant-Group Approach to Investigation of k-Fault-Tolerant Structures, Avtom. Telemekh., 2000, no. 1, pp. 144–156.
Author information
Authors and Affiliations
Additional information
Translated from Avtomatika i Telemekhanika, No. 2, 2005, pp. 175–189.
Original Russian Text Copyright © 2005 by Karavai.
Rights and permissions
About this article
Cite this article
Karavai, M.F. Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II. Grids and k-fault-tolerance. Autom Remote Control 66, 328–340 (2005). https://doi.org/10.1007/s10513-005-0055-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10513-005-0055-8