Analysis and synthesis problems for network resilience

Research output: Contribution to journalArticle

9 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)43-48
Number of pages6
JournalMathematical and Computer Modelling
Volume17
Issue number11
DOIs
StatePublished - 1993
Externally publishedYes

Fingerprint

Resilience
Synthesis
Vertex of a graph
Node

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Information Systems and Management
  • Control and Systems Engineering
  • Applied Mathematics
  • Computational Mathematics
  • Modeling and Simulation

Cite this

Analysis and synthesis problems for network resilience. / Colbourn, Charles.

In: Mathematical and Computer Modelling, Vol. 17, No. 11, 1993, p. 43-48.

Research output: Contribution to journalArticle

@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 = "Charles Colbourn",
year = "1993",
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

PY - 1993

Y1 - 1993

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

VL - 17

SP - 43

EP - 48

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

SN - 0895-7177

IS - 11

ER -