Fault tree models for reliability analysis of an FDDI token ring network

ABSTRACT

As suggested by the title the purpose of this paper is twofold. One goal is to analyze the reliability of the FDDI token ring, and the other is to demonstrate the usefulness of the fault tree concept in the design and analysis of a complex system. Combinatorial and markov chain analysis of FDDI reliability leads to a complex model that at times is difficult to validate. The fault tree model, however, is easy to construct, verify and solve. Fault tree models are built for two examples of FDDI token rings. We also consider the impact of the link "wrap-around" recovery mechanism on system reliability. It turns out that the use of the "wrap-around" does not always improve system reliability.

REFERENCES

• 1: BATEMAN, K., AND CORTES, E. Availability modeling of FDDI networks. In Reliability and Maintainability Symposium (January 1989).
• 2: DUGAN, J. B., BAVUSO, S., AND BOYD, M. Fault trees and sequence dependencies. In Reliability and Maintainability Symposium (January 1990), pp. 286-293.
• 3: DUGAN, J. B., TRIVEDI, K., SMOTHERMAN, M., AND GRIST, R. The hybrid automated reliability predictor. AIAA Journal of Guidance, Control and Dynamics 9, no. 3 (1986), 319-331.
• 4: LOGOTHETIS, D., AND TRIVEDI, K. Reliability of fddi token ring. In 16th Conference on Local Computer Networks (October 1991).
• 5: Ross, F. FDDI- a tutorial. IEEE Communications Magazine P4, 5 (1986), 10-17.
• 6: Ross, F. Kings are 'round for good. IEEE Network Magazine 1, 1 (1987), 31-38.
• 7: VEERARAGHAVAN, M. Modeling and evaluation of fault-tolerant multiple processor systems. PhD thesis, Department of electrical engineering, Duke university, 1988.