Analysis and synthesis problems for network resilience

Authors:
Charles J. Colbourn
Affiliations:
Computer Communications Networks Group, Department of Computer Science University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1993

Citing 3
Cited 1

The complexity of reliability computations in planar and acyclic graphs

SIAM Journal on Computing
Bounding all-terminal reliability in computer networks

Networks
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability

First passage time and first passage percolation models for analysing network resilience and effective strategies in strategic information warfare research: a brief survey and perspective

International Journal of Information and Computer Security

Quantified Score

Hi-index	0.98

Visualization

Abstract

The resilience of a network is the expected number of node pairs which can communicate in the network, when links fail independently with known probabilities. We examine the analysis and synthesis problems for resilience; many of the results parallel those on all-terminal reliability.