### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - IEEE INFOCOM |

Publisher | IEEE |

Pages | 290-292 |

Number of pages | 3 |

ISBN (Print) | 0818606940 |

State | Published - Jan 1 1986 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

ISSN (Print) | 0743-166X |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE INFOCOM*(pp. 290-292). (Proceedings - IEEE INFOCOM). IEEE.