Efficient enumeration of most probable states for systems with dependent failures and multimode components

Author

Le, Khiem V. ; Li, Victor O K

Author_Institution

Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA

fYear

1990

fDate

2-5 Dec 1990

Firstpage

693

Abstract

ORDER-c, an algorithm for enumerating, in order of nonincreasing probability, the states of systems with dependent failures and multimode components is presented. The dependencies and degradations are modeled by the cause-based multimode model, which is reviewed. The ORDER-b algorithm is also reviewed, and the ORDER-b and ORDER-c algorithms are compared. The ORDER-algorithm is shown to be more flexible than the ORDER-b algorithm because it can be based on any state enumeration algorithm for independent failures and multimode components. Experimental results show that the ORDER-c algorithm requires less memory and runs faster

Keywords

failure analysis; probability; telecommunication networks; ORDER-b algorithm; ORDER-c algorithm; communication networks; dependent failures; most probable states; multimode components; Atmospheric modeling; Communication networks; Degradation; Electric variables measurement; Failure analysis; Force measurement; Independent component analysis; Performance evaluation; Reliability engineering; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1990, and Exhibition. 'Communications: Connecting the Future', GLOBECOM '90., IEEE

Conference_Location

San Diego, CA

Print_ISBN

0-87942-632-2

Type

conf

DOI

10.1109/GLOCOM.1990.116459

Filename

116459