Accession Number:

ADA170275

Title:

Markov Algorithms for Computing the Reliability of Staged Networks.

Descriptive Note:

Technical rept.,

Corporate Author:

NORTH CAROLINA UNIV AT CHAPEL HILL CURRICULUM IN OPERATIONS RESEARCH AND SYSTEMS ANALYSIS

Personal Author(s):

Report Date:

1986-04-01

Pagination or Media Count:

28.0

Abstract:

Certain commonly occurring types of network, whether directed or undirected, exhibit a staged structure. Two algorithms, based on node partitioning, are presented which take advantage of such structure and which use a Markov transition-probability form of recursion. The algorithm for directed networks is related to the Markov chain formulation of Bailey and Kulkarni, but for undirected netweorks a more detailed form of state definition is used related to one suggested by Rosenthal. The computational advantages of the algorithms are discussed and some numerical results presented. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE