Title :
Fault trees for computer networks with a single nondedicated spare node
Author :
Schneeweiss, Winfrid G.
Author_Institution :
Fern Univ., Hagen, Germany
Abstract :
This paper concerns the quantification of the fault tolerance of computer networks, where at least n-1 of the networks n nodes need to be intact and connected for mission success. The fault tree construction process is bottom up through 3 levels: i) point-to-point connectivity, ii) k-terminal connectivity, iii) “logical” combination of the connectivity of several clusters, such as for high-level tasks of parallel computing
Keywords :
computer network reliability; computer networks; fault tolerant computing; fault trees; computer networks; connectivity; fault tolerance; high-level tasks; nondedicated spare node; parallel computing; quantification; Bridges; Computer aided engineering; Computer networks; Electronic mail; Fault tolerance; Fault trees; Network synthesis; Network topology; Parallel processing; Reliability theory;
Conference_Titel :
Fault-Tolerant Parallel and Distributed Systems, 1994., Proceedings of IEEE Workshop on
Conference_Location :
College Station, TX
Print_ISBN :
0-8186-6807-5
DOI :
10.1109/FTPDS.1994.494500
