Title :
Reliability computation of multistage interconnection networks
Author :
Botting, Christopher ; Rai, Suresh ; Agrawal, Dharma P.
Author_Institution :
Bell Northern Res., Research Triangle Park, NC, USA
fDate :
4/1/1989 12:00:00 AM
Abstract :
A general algorithm that generates a reliability expression for these measures is presented. The reliability is analyzed under the assumption of statistical independence of failure. Nonetheless, failure dependencies can also be solved. This method is appropriate for analyzing other computer networks. To model networks with switching elements (SEs), the SE is considered as good or bad. The complex fault models are described. The analytic method is implemented by a Pascal program. The advantages of the proposed method are: (1) flexibility-this technique can handle statistically independent and dependent failures within the network, while failure dependencies use the Lam-Li model; this technique is easily extendable for the analysis of M-input N-output multistage interconnection networks; (2) generality-this technique derives the reliability of networks from the points of view of terminal reliability, broadcasting, and network reliability; and (3) cost effectiveness-the necessary system information can be obtained at very little additional cost, once the connection equation of the network has been obtained
Keywords :
computer networks; fault tolerant computing; multiprocessor interconnection networks; reliability; Pascal program; complex fault models; computer networks; failure dependencies; multistage interconnection networks; reliability expression; statistical independence of failure; switching elements; Algorithm design and analysis; Boolean algebra; Broadcasting; Computer network reliability; Computer networks; Costs; Failure analysis; Multiprocessor interconnection networks; Reliability theory; Switches;
Journal_Title :
Reliability, IEEE Transactions on