MULTI-TERMINAL NETWORK CONNECTEDNESS on SERIES-PARALLEL NETWORKS

Toni R. Farley, Charles J. Colbourn

Research output: Contribution to journalArticle

Abstract

Network operation may require that a specified number k of nodes be able to communicate via paths consisting of operating edges and nodes. In an environment of node and edge failure, this leads to associated reliability measures. When the k nodes are known in advance, this has been widely studied as k-terminal reliability; when the k nodes are chosen uniformly at random, this has been studied as k-resilience. A third notion, when it suffices to have anyk nodes communicate, is related to the expected size of the largest component in the network. We generalize these three measures to the probability that given h nodes chosen in advance and i nodes chosen at random, they appear in a component of size at least k = h + i + j. As expected, for general networks, for most choices of (h, i, j) the computation is #P-complete and hence unlikely to admit a polynomial time algorithm. We develop polynomial time algorithms in the special case that the network is series-parallel, which subsume and generalize earlier methods for k-terminal reliability and k-resilience.

Original languageEnglish (US)
Pages (from-to)253-265
Number of pages13
JournalDiscrete Mathematics, Algorithms and Applications
Volume1
Issue number2
DOIs
StatePublished - Jun 1 2009

Fingerprint

Connectedness
Vertex of a graph
Resilience
Polynomial-time Algorithm
Generalise
Path
Series

Keywords

  • Network reliability
  • network resilience
  • series-parallel networks

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

MULTI-TERMINAL NETWORK CONNECTEDNESS on SERIES-PARALLEL NETWORKS. / Farley, Toni R.; Colbourn, Charles J.

In: Discrete Mathematics, Algorithms and Applications, Vol. 1, No. 2, 01.06.2009, p. 253-265.

Research output: Contribution to journalArticle

@article{241c18a6017c4cd7b2a83301fc4aab05,
title = "MULTI-TERMINAL NETWORK CONNECTEDNESS on SERIES-PARALLEL NETWORKS",
abstract = "Network operation may require that a specified number k of nodes be able to communicate via paths consisting of operating edges and nodes. In an environment of node and edge failure, this leads to associated reliability measures. When the k nodes are known in advance, this has been widely studied as k-terminal reliability; when the k nodes are chosen uniformly at random, this has been studied as k-resilience. A third notion, when it suffices to have anyk nodes communicate, is related to the expected size of the largest component in the network. We generalize these three measures to the probability that given h nodes chosen in advance and i nodes chosen at random, they appear in a component of size at least k = h + i + j. As expected, for general networks, for most choices of (h, i, j) the computation is #P-complete and hence unlikely to admit a polynomial time algorithm. We develop polynomial time algorithms in the special case that the network is series-parallel, which subsume and generalize earlier methods for k-terminal reliability and k-resilience.",
keywords = "Network reliability, network resilience, series-parallel networks",
author = "Farley, {Toni R.} and Colbourn, {Charles J.}",
year = "2009",
month = "6",
day = "1",
doi = "10.1142/S1793830909000208",
language = "English (US)",
volume = "1",
pages = "253--265",
journal = "Discrete Mathematics, Algorithms and Applications",
issn = "1793-8309",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

TY - JOUR

T1 - MULTI-TERMINAL NETWORK CONNECTEDNESS on SERIES-PARALLEL NETWORKS

AU - Farley, Toni R.

AU - Colbourn, Charles J.

PY - 2009/6/1

Y1 - 2009/6/1

N2 - Network operation may require that a specified number k of nodes be able to communicate via paths consisting of operating edges and nodes. In an environment of node and edge failure, this leads to associated reliability measures. When the k nodes are known in advance, this has been widely studied as k-terminal reliability; when the k nodes are chosen uniformly at random, this has been studied as k-resilience. A third notion, when it suffices to have anyk nodes communicate, is related to the expected size of the largest component in the network. We generalize these three measures to the probability that given h nodes chosen in advance and i nodes chosen at random, they appear in a component of size at least k = h + i + j. As expected, for general networks, for most choices of (h, i, j) the computation is #P-complete and hence unlikely to admit a polynomial time algorithm. We develop polynomial time algorithms in the special case that the network is series-parallel, which subsume and generalize earlier methods for k-terminal reliability and k-resilience.

AB - Network operation may require that a specified number k of nodes be able to communicate via paths consisting of operating edges and nodes. In an environment of node and edge failure, this leads to associated reliability measures. When the k nodes are known in advance, this has been widely studied as k-terminal reliability; when the k nodes are chosen uniformly at random, this has been studied as k-resilience. A third notion, when it suffices to have anyk nodes communicate, is related to the expected size of the largest component in the network. We generalize these three measures to the probability that given h nodes chosen in advance and i nodes chosen at random, they appear in a component of size at least k = h + i + j. As expected, for general networks, for most choices of (h, i, j) the computation is #P-complete and hence unlikely to admit a polynomial time algorithm. We develop polynomial time algorithms in the special case that the network is series-parallel, which subsume and generalize earlier methods for k-terminal reliability and k-resilience.

KW - Network reliability

KW - network resilience

KW - series-parallel networks

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

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

U2 - 10.1142/S1793830909000208

DO - 10.1142/S1793830909000208

M3 - Article

VL - 1

SP - 253

EP - 265

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

SN - 1793-8309

IS - 2

ER -