About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
approximating dependability measures of computer networks: An FDDI case study
Abstract
An approximation technique is presented to evaluate the dependability of FDDI networks. This technique, based on the most likely paths to failure concept, is simple and practical. It may be applied easily to evaluate and compare the dependability of different FDDI network configurations. The effects of various network parameters on the network availability are examined. We conclude that, in order to guarantee high availability, an FDDI network backbone should be interconnected using dual-attachment concentrators. Furthermore, dual-homing configurations are required for high-availability paths between end stations and the backbone. For less stringent availability requirements, single-attachment concentrator trees with single-attachment stations may suffice. We also discuss how the technique may be extended easily to more general heterogeneous networks including Token Ring and Ethernet. © 1997 IEEE.