Bounding flow-performance in probabilistic weighted networks

Heidi J. Strayer, Charles Colbourn

Research output: Contribution to journalArticle

Abstract

Summary & Conclusions -Much research has been done on computing connectivity-probability in probabilistic networks. More recently, the area has been expanded to other performance measures, such as maxflow & distance. These problems are, in general, NP-hard. Therefore efficiently computable, and accurate, lower & upper bounds are sought. This paper presents: 1) distance renormalization which generalizes the reliability renormalization algorithm of Harms & Colbourn for bounding probabilistic distances in bi-directional probabilistic weighted networks; 2) a mechanism based on non-planar duality for using this algorithm to bound probabilistic maxflow and mean maxflow. The results obtained via distance renormalization compare favorably with other current techniques for our suite of test cases.

Original languageEnglish (US)
Pages (from-to)3-10
Number of pages8
JournalIEEE Transactions on Reliability
Volume46
Issue number1
DOIs
StatePublished - 1997
Externally publishedYes

Keywords

  • Average maxflow
  • Distance upper bound
  • Maxflow lower bound
  • Multistate link
  • Probabilistic network

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Bounding flow-performance in probabilistic weighted networks. / Strayer, Heidi J.; Colbourn, Charles.

In: IEEE Transactions on Reliability, Vol. 46, No. 1, 1997, p. 3-10.

Research output: Contribution to journalArticle

@article{d85e428b974f4d9fbdafd639f48d0e6d,
title = "Bounding flow-performance in probabilistic weighted networks",
abstract = "Summary & Conclusions -Much research has been done on computing connectivity-probability in probabilistic networks. More recently, the area has been expanded to other performance measures, such as maxflow & distance. These problems are, in general, NP-hard. Therefore efficiently computable, and accurate, lower & upper bounds are sought. This paper presents: 1) distance renormalization which generalizes the reliability renormalization algorithm of Harms & Colbourn for bounding probabilistic distances in bi-directional probabilistic weighted networks; 2) a mechanism based on non-planar duality for using this algorithm to bound probabilistic maxflow and mean maxflow. The results obtained via distance renormalization compare favorably with other current techniques for our suite of test cases.",
keywords = "Average maxflow, Distance upper bound, Maxflow lower bound, Multistate link, Probabilistic network",
author = "Strayer, {Heidi J.} and Charles Colbourn",
year = "1997",
doi = "10.1109/24.589919",
language = "English (US)",
volume = "46",
pages = "3--10",
journal = "IEEE Transactions on Reliability",
issn = "0018-9529",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Bounding flow-performance in probabilistic weighted networks

AU - Strayer, Heidi J.

AU - Colbourn, Charles

PY - 1997

Y1 - 1997

N2 - Summary & Conclusions -Much research has been done on computing connectivity-probability in probabilistic networks. More recently, the area has been expanded to other performance measures, such as maxflow & distance. These problems are, in general, NP-hard. Therefore efficiently computable, and accurate, lower & upper bounds are sought. This paper presents: 1) distance renormalization which generalizes the reliability renormalization algorithm of Harms & Colbourn for bounding probabilistic distances in bi-directional probabilistic weighted networks; 2) a mechanism based on non-planar duality for using this algorithm to bound probabilistic maxflow and mean maxflow. The results obtained via distance renormalization compare favorably with other current techniques for our suite of test cases.

AB - Summary & Conclusions -Much research has been done on computing connectivity-probability in probabilistic networks. More recently, the area has been expanded to other performance measures, such as maxflow & distance. These problems are, in general, NP-hard. Therefore efficiently computable, and accurate, lower & upper bounds are sought. This paper presents: 1) distance renormalization which generalizes the reliability renormalization algorithm of Harms & Colbourn for bounding probabilistic distances in bi-directional probabilistic weighted networks; 2) a mechanism based on non-planar duality for using this algorithm to bound probabilistic maxflow and mean maxflow. The results obtained via distance renormalization compare favorably with other current techniques for our suite of test cases.

KW - Average maxflow

KW - Distance upper bound

KW - Maxflow lower bound

KW - Multistate link

KW - Probabilistic network

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

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

U2 - 10.1109/24.589919

DO - 10.1109/24.589919

M3 - Article

AN - SCOPUS:0031100630

VL - 46

SP - 3

EP - 10

JO - IEEE Transactions on Reliability

JF - IEEE Transactions on Reliability

SN - 0018-9529

IS - 1

ER -