Sixty Years of Network Reliability

The study of network reliability started in 1956 with a groundbreaking paper by E.F. Moore and C.E. Shannon. They introduced a probabilistic model of network reliability, where the nodes of the network were considered to be perfectly reliable, and the links or edges could fail independently with a c...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics in computer science 2018-09, Vol.12 (3), p.275-293
Main Author: Pérez-Rosés, Hebert
Format: Article
Language:English
Subjects:
Computer Science
Mathematics
Mathematics and Statistics
Network reliability
Probabilistic models
Statistical analysis
System reliability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The study of network reliability started in 1956 with a groundbreaking paper by E.F. Moore and C.E. Shannon. They introduced a probabilistic model of network reliability, where the nodes of the network were considered to be perfectly reliable, and the links or edges could fail independently with a certain probability. The problem is to determine the probability that the network remains connected under these conditions. If all the edges have the same probability of failing, this leads to the so-called reliability polynomial of the network. Sixty years later, a lot of research has accumulated on this topic, and many variants of the original problem have been investigated. We review the basic concepts and results, as well as some recent developments in this area, and we outline some important research directions.
ISSN:1661-8270
1661-8289
DOI:10.1007/s11786-018-0345-5