Premium
First‐and second‐order bounds on terminal reliability
Author(s) -
Assous J. Yael
Publication year - 1986
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230160307
Subject(s) - terminal (telecommunication) , upper and lower bounds , reliability (semiconductor) , heuristic , computer science , mathematical optimization , independence (probability theory) , order (exchange) , mathematics , algorithm , statistics , computer network , mathematical analysis , power (physics) , physics , finance , quantum mechanics , economics
We show that existing network algorithms solve the terminal reliability bound problem under limited information about the probabilities of operation of the components. Tightening of the bounds is achieved by introducing bounds on the probabilities that pairs of network components fail. A heuristic algorithm is developed to determine a tighter lower bound. The problem of the upper bound is also addressed. Our approach discards the traditional assumption of statistical independence of components' failures.