Name
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/90.588115 | IEEE/ACM Trans. Netw. |
Keywords | Field | DocType |
Computer networks,FDDI,Computer aided software engineering,Availability,Token networks,Computer network reliability,Spine,Ethernet networks,Polynomials,Monte Carlo methods | Dependability,Computer science,Fiber Distributed Data Interface,Token ring,Computer network,Ethernet,Local area network,Heterogeneous network,High availability,Concentrator,Distributed computing | Journal |
Volume | Issue | ISSN |
5 | 2 | 1063-6692 |
Citations | PageRank | References |
4 | 0.61 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Willebeek-lemair | 1 | 321 | 27.84 |
| Perwez Shahabuddin | 2 | 1364 | 181.65 |