Evaluating performability: Most probable states and bounds

Charles J. Colbourn; Daryl D. Harms

doi:10.1007/BF02109862

Evaluating performability: Most probable states and bounds

Charles J. Colbourn, Daryl D. Harms

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

16 Scopus citations

Abstract

The number of states examined by most probable state algorithms for performability computations can be reduced dramatically by incorporating simple connectivity-based bounds, even when the performability measure is much more complex than connectivity. Modifications to Yang and Kubat's most probable state method are presented that permit the use of simple auxiliary bounds with only a small effect on the time per iteration. Computational results for a variety of performability measures are given.

Original language	English (US)
Pages (from-to)	275-300
Number of pages	26
Journal	Telecommunication Systems
Volume	2
Issue number	1
DOIs	https://doi.org/10.1007/BF02109862
State	Published - Dec 1 1993
Externally published	Yes

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1007/BF02109862

Cite this

@article{c48fd418ad4542ff9d877a2c71d22d2f,

title = "Evaluating performability: Most probable states and bounds",

abstract = "The number of states examined by most probable state algorithms for performability computations can be reduced dramatically by incorporating simple connectivity-based bounds, even when the performability measure is much more complex than connectivity. Modifications to Yang and Kubat's most probable state method are presented that permit the use of simple auxiliary bounds with only a small effect on the time per iteration. Computational results for a variety of performability measures are given.",

author = "Colbourn, {Charles J.} and Harms, {Daryl D.}",

year = "1993",

month = dec,

day = "1",

doi = "10.1007/BF02109862",

language = "English (US)",

volume = "2",

pages = "275--300",

journal = "Telecommunication Systems",

issn = "1018-4864",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Evaluating performability

T2 - Most probable states and bounds

AU - Colbourn, Charles J.

AU - Harms, Daryl D.

PY - 1993/12/1

Y1 - 1993/12/1

N2 - The number of states examined by most probable state algorithms for performability computations can be reduced dramatically by incorporating simple connectivity-based bounds, even when the performability measure is much more complex than connectivity. Modifications to Yang and Kubat's most probable state method are presented that permit the use of simple auxiliary bounds with only a small effect on the time per iteration. Computational results for a variety of performability measures are given.

AB - The number of states examined by most probable state algorithms for performability computations can be reduced dramatically by incorporating simple connectivity-based bounds, even when the performability measure is much more complex than connectivity. Modifications to Yang and Kubat's most probable state method are presented that permit the use of simple auxiliary bounds with only a small effect on the time per iteration. Computational results for a variety of performability measures are given.

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

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

U2 - 10.1007/BF02109862

DO - 10.1007/BF02109862

M3 - Article

AN - SCOPUS:0037883114

SN - 1018-4864

VL - 2

SP - 275

EP - 300

JO - Telecommunication Systems

JF - Telecommunication Systems

IS - 1

ER -

Evaluating performability: Most probable states and bounds

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this