Analysis and synthesis problems for network resilience

Charles J. Colbourn

doi:10.1016/0895-7177(93)90251-S

Analysis and synthesis problems for network resilience

Charles J. Colbourn

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

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.

Original language	English (US)
Pages (from-to)	43-48
Number of pages	6
Journal	Mathematical and Computer Modelling
Volume	17
Issue number	11
DOIs	https://doi.org/10.1016/0895-7177(93)90251-S
State	Published - Jun 1993
Externally published	Yes

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications

Access to Document

10.1016/0895-7177(93)90251-S

Cite this

@article{fb6c4528f4054117af271cf958031033,

title = "Analysis and synthesis problems for network resilience",

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.",

author = "Colbourn, {Charles J.}",

note = "Funding Information: in Las Cruces. The author{\textquoteright}s research is supported by NSERC Canada",

year = "1993",

month = jun,

doi = "10.1016/0895-7177(93)90251-S",

language = "English (US)",

volume = "17",

pages = "43--48",

journal = "Mathematical and Computer Modelling",

issn = "0895-7177",

publisher = "Elsevier Limited",

number = "11",

}

TY - JOUR

T1 - Analysis and synthesis problems for network resilience

AU - Colbourn, Charles J.

N1 - Funding Information: in Las Cruces. The author’s research is supported by NSERC Canada

PY - 1993/6

Y1 - 1993/6

N2 - 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.

AB - 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.

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

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

U2 - 10.1016/0895-7177(93)90251-S

DO - 10.1016/0895-7177(93)90251-S

M3 - Article

AN - SCOPUS:38249002832

SN - 0895-7177

VL - 17

SP - 43

EP - 48

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

IS - 11

ER -

Analysis and synthesis problems for network resilience

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this