DocumentCode
1315598
Title
Bayesian Decomposition Method for Computing the Reliability of an Oriented Network
Author
Nakazawa, Hayao
Author_Institution
4-432 Shin-Sakuragaoka-Danchi//Imaicho Hodogayaku Yokohama City 240 JAPAN
Issue
2
fYear
1976
fDate
6/1/1976 12:00:00 AM
Firstpage
77
Lastpage
80
Abstract
For a nonoriented network, Bayesian decomposition is straightforward and well known. A keystone element is assumed perfect (shorted), then failed (open) and the reliabilities of the two subnetworks are calculated. But for an oriented network, when the keystone element is assumed perfect, it cannot always be shorted (the 2 nodes brought together), because even a perfect element still retains its orientation. A technique for choosing keystone elements is proposed.
Keywords
Bayesian methods; Computer networks; Redundancy; Reliability engineering; Reliability theory; Bayesian decomposition; Network analysis; Oriented network; Redundancy;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/TR.1976.5214983
Filename
5214983
Link To Document