Markov Algorithms for Computing the Reliability of Staged Networks.

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1986
Accession Number
ADA170275

Entities

People

  • R. C. Cheng

Organizations

  • University of North Carolina at Chapel Hill

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computational Complexity
  • Computations
  • Computers
  • Decomposition
  • Dynamic Programming
  • Markov Chains
  • North Carolina
  • Operations Research
  • Personal Computers
  • Probability
  • Reliability
  • Systems Analysis
  • Transitions
  • United States

Readers

  • Graph Algorithms and Convex Optimization.
  • Statistical inference.
  • Systems Analysis and Design