MOST RELIABLE SERIES-PARALLEL NETWORKS.

Eric M. Neufeld, Charles Colbourn

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The design of reliable communications networks is an interesting and important topic. Perhaps the most common measure of reliability is a probabilistic one: the probability that a network is connected given the possibility of statistically independent line failures. In general, this is not efficiently computable. In this article, we develop a formula for the reliability of the most reliable maximal series-parallel networks. The most reliable maximal series-parallel networks are those maximal series-parallel networks with the minimum number of vertices of degree 2, independent of many of the simpler reliability estimates. A two-dimensional recurrence relating networks of varying sizes and edge deficiencies provides a generating function which in turn is exploited to give a simple closed expression for reliability.

Original languageEnglish (US)
Pages (from-to)27-32
Number of pages6
JournalNetworks
Volume15
Issue number1
StatePublished - Mar 1985
Externally publishedYes

Fingerprint

Telecommunication networks

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

MOST RELIABLE SERIES-PARALLEL NETWORKS. / Neufeld, Eric M.; Colbourn, Charles.

In: Networks, Vol. 15, No. 1, 03.1985, p. 27-32.

Research output: Contribution to journalArticle

Neufeld, EM & Colbourn, C 1985, 'MOST RELIABLE SERIES-PARALLEL NETWORKS.', Networks, vol. 15, no. 1, pp. 27-32.
Neufeld, Eric M. ; Colbourn, Charles. / MOST RELIABLE SERIES-PARALLEL NETWORKS. In: Networks. 1985 ; Vol. 15, No. 1. pp. 27-32.
@article{919f8628656342f795b55e1609d730e3,
title = "MOST RELIABLE SERIES-PARALLEL NETWORKS.",
abstract = "The design of reliable communications networks is an interesting and important topic. Perhaps the most common measure of reliability is a probabilistic one: the probability that a network is connected given the possibility of statistically independent line failures. In general, this is not efficiently computable. In this article, we develop a formula for the reliability of the most reliable maximal series-parallel networks. The most reliable maximal series-parallel networks are those maximal series-parallel networks with the minimum number of vertices of degree 2, independent of many of the simpler reliability estimates. A two-dimensional recurrence relating networks of varying sizes and edge deficiencies provides a generating function which in turn is exploited to give a simple closed expression for reliability.",
author = "Neufeld, {Eric M.} and Charles Colbourn",
year = "1985",
month = "3",
language = "English (US)",
volume = "15",
pages = "27--32",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - MOST RELIABLE SERIES-PARALLEL NETWORKS.

AU - Neufeld, Eric M.

AU - Colbourn, Charles

PY - 1985/3

Y1 - 1985/3

N2 - The design of reliable communications networks is an interesting and important topic. Perhaps the most common measure of reliability is a probabilistic one: the probability that a network is connected given the possibility of statistically independent line failures. In general, this is not efficiently computable. In this article, we develop a formula for the reliability of the most reliable maximal series-parallel networks. The most reliable maximal series-parallel networks are those maximal series-parallel networks with the minimum number of vertices of degree 2, independent of many of the simpler reliability estimates. A two-dimensional recurrence relating networks of varying sizes and edge deficiencies provides a generating function which in turn is exploited to give a simple closed expression for reliability.

AB - The design of reliable communications networks is an interesting and important topic. Perhaps the most common measure of reliability is a probabilistic one: the probability that a network is connected given the possibility of statistically independent line failures. In general, this is not efficiently computable. In this article, we develop a formula for the reliability of the most reliable maximal series-parallel networks. The most reliable maximal series-parallel networks are those maximal series-parallel networks with the minimum number of vertices of degree 2, independent of many of the simpler reliability estimates. A two-dimensional recurrence relating networks of varying sizes and edge deficiencies provides a generating function which in turn is exploited to give a simple closed expression for reliability.

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

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

M3 - Article

AN - SCOPUS:0022034518

VL - 15

SP - 27

EP - 32

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -