TY - GEN

T1 - RELIABILITY BOUNDS FOR NETWORKS WITH STATISTICAL DEPENDENCE.

AU - Carrasco, Eddy H.

AU - Colbourn, Charles J.

PY - 1986/1/1

Y1 - 1986/1/1

N2 - Many bounds for the all-terminal reliability of a network have been proposed, but most assume that link failures are statistically independent. The authors develop a lower bound for the all-terminal reliability of a network when statistical dependence of link failures occurs; in particular, a bound is produced when information about failure of links and failure of pairs of links is given. The value produced is an absolute lower bound, which holds under the most pessimistic assumptions about unspecified statistical dependencies. Moreover, the bound can be computed in polynomial time; this distinguishes it from many available bounds.

AB - Many bounds for the all-terminal reliability of a network have been proposed, but most assume that link failures are statistically independent. The authors develop a lower bound for the all-terminal reliability of a network when statistical dependence of link failures occurs; in particular, a bound is produced when information about failure of links and failure of pairs of links is given. The value produced is an absolute lower bound, which holds under the most pessimistic assumptions about unspecified statistical dependencies. Moreover, the bound can be computed in polynomial time; this distinguishes it from many available bounds.

UR - http://www.scopus.com/inward/record.url?scp=0022584504&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022584504&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0022584504

SN - 0818606940

T3 - Proceedings - IEEE INFOCOM

SP - 290

EP - 292

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -