APPROXIMATING DEPENDABILITY MEASURES OF COMPUTER-NETWORKS - AN FDDI CASE-STUDY

Citation
M. Willebeeklemair et P. Shahabuddin, APPROXIMATING DEPENDABILITY MEASURES OF COMPUTER-NETWORKS - AN FDDI CASE-STUDY, IEEE/ACM transactions on networking, 5(2), 1997, pp. 311-327
Citations number
27
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
ISSN journal
10636692
Volume
5
Issue
2
Year of publication
1997
Pages
311 - 327
Database
ISI
SICI code
1063-6692(1997)5:2<311:ADMOC->2.0.ZU;2-E
Abstract
An approximation technique is presented to evaluate the dependability of FDDI networks, This technique, based on the most likely paths to fa ilure concept, is simple and practical, It may be applied easily to ev aluate and compare the dependability of different FDDI network configu rations, The effects of various network parameters on the network avai lability are examined, We conclude that, in order to guarantee high av ailability, an FDDI network backbone should be interconnected using du al-attachment concentrators, Furthermore, dual-homing configurations a re required for high-availability paths between end stations and the b ackbone, For less stringent availability requirements, single-attachme nt 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.