By Topic

A Simple Universal Generating Function Method to Search for All Minimal Paths in Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wei-Chang Yeh ; Dept. of Ind. Eng. & Eng. Manage., Nat. Tsing Hua Univ., Hsinchu, Taiwan

Evaluating network reliability is an important topic in planning, designing, and control of systems, and the minimal-path (MP) set is one of the fundamental tools for evaluating network reliability. A straightforward and simple algorithm is presented here for finding all MPs before calculating the binary-state network reliability between the source node and the sink node (i.e., one-to-one reliability). It is based on the universal generating function method (UGFM) and a generalized composition operator. The computational complexity of the proposed algorithm is also analyzed. Finally, an example is given to illustrate how all MPs are generated using the proposed UGFM.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:39 ,  Issue: 6 )