DocumentCode
975638
Title
Efficient computation of most probably states for communication networks with multimode components
Author
Yang, Che-Liang ; Kubat, Peter
Author_Institution
GTE Lab. Inc., Waltham, MA, USA
Volume
37
Issue
5
fYear
1989
fDate
5/1/1989 12:00:00 AM
Firstpage
535
Lastpage
538
Abstract
A general multimode model for jointly assessing the performance and reliability (performability) of a communication network is considered. The performability is computed by averaging the performance over the most probable network states. An efficient algorithm, superior to all previous algorithms in both speed and flexibility, is proposed to enumerate the most probable network states. The algorithm keeps generating the network states one by one, in order of decreasing probability, until some stopping rule (if specified) is met
Keywords
probability; reliability; telecommunication networks; trees (mathematics); communication networks; efficient algorithm; general multimode model; most probable network states; multimode components; performability; probability; reliability; stopping rule; tree search problem; Communication networks; Communications Society; Computer network reliability; Computer networks; Degradation; Probability; State-space methods; Steady-state; Telecommunication network reliability;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.24607
Filename
24607
Link To Document