Evaluating performability: Most probable states and bounds

Charles J. Colbourn, Daryl D. Harms

Research output: Contribution to journalArticlepeer-review

15 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 languageEnglish (US)
Pages (from-to)275-300
Number of pages26
JournalTelecommunication Systems
Volume2
Issue number1
DOIs
StatePublished - Dec 1 1993
Externally publishedYes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this