A protocol for repairing a system of communicating processes with a structure of the optimal rooted tree spanning the graph of a distributed computer system, with the minimal distance from any tree vertex to the rooted one, is proposed. The protocol ensures repair of the optimal spanning tree for both the steady and intermittent failures of elementary computers and intercomputer connections of the distributed computer system.
展开▼
