DocumentCode :
1852213
Title :
Algorithms for network reliability and connection availability analysis
Author :
Shooman, Andrew M.
Author_Institution :
EMC Corp., Hopkinton, MA, USA
fYear :
1995
fDate :
21-23 Jun 1995
Firstpage :
309
Lastpage :
333
Abstract :
Communications networks used for transmitting and receiving voice or digital data involve copper wire, fiber optics, radio, satellite, and microwave links. In general, these networks are large, diffuse, and complex. Even using modern high-speed computers, exact computations of the network reliability for use as a figure of merit in an interactive network design procedure can take an inordinate amount of time. This paper discusses various exact techniques whose complexity results in run-times short enough for practical network design. We model the network by an undirected probabilistic graph whose vertices represent the nodes and whose edges represent the links. A special feature of our model is that it allows nodes to be imperfect and associates a reliability measure with each node, assumed to succeed or fail independently. Therefore, the network reliability measure is based upon the reliability measures of the individual links and nodes
Keywords :
communication complexity; computer network reliability; complexity; connection availability analysis; digital data; interactive network design procedure; network reliability; undirected probabilistic graph; voice data; Artificial satellites; Availability; Communication networks; Computer network reliability; Computer networks; Copper; Optical fibers; Satellite broadcasting; Telecommunication network reliability; Wire;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electro/95 International. Professional Program Proceedings.
Conference_Location :
Boston, MA
Print_ISBN :
0-7803-2633-4
Type :
conf
DOI :
10.1109/ELECTR.1995.471030
Filename :
471030
Link To Document :
بازگشت