DocumentCode
1462884
Title
Commentary on: reliability polynomials and link importance in networks
Author
Traldi, Lorenzo
Author_Institution
Dept. of Math., Lafayette Coll., Easton, PA, USA
Volume
49
Issue
3
fYear
2000
fDate
9/1/2000 12:00:00 AM
Firstpage
322
Abstract
The author comments on the paper by L.B. Page et al., (see ibid., vol.43, p.51-8, 1994). The author considers the reliability of a communication network, represented by a graph G of nodes and edges (also called "links"); the nodes are assumed to be perfectly operational and the edges are assumed to be Y-independently operational with probability p. He points out the redundancy. The original author replies to the comment.
Keywords
polynomials; redundancy; telecommunication network reliability; Y-independently operational; communication network reliability; graph; link importance; probability; redundancy; reliability polynomials; Combinatorial mathematics; Communication networks; Instruments; Intelligent networks; Network topology; Performance loss; Polynomials; Redundancy; Reliability theory; Telecommunication network reliability;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/24.914550
Filename
914550
Link To Document