Structural Factoring Approach for Analyzing Stochastic Networks

By: Nasa, National Aeronautics and Space Adm

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques. Hayhurst, Kelly J. and Shier, Douglas R. Langley Research Center RTOP 505-66-21-01...

• Format: Paperback
• Language: English
• ISBN: 1729014267
• ISBN13: 9781729014264
• Release Date: January 1
• Publisher: Independently Published
• Length: 30 Pages
• Weight: 0.21 lbs.
• Dimensions: 0.1" x 8.5" x 11.0"