The Algorithm Research Of Reliability Of Stochastic Flow Network

Network of link-capacities extensively exists. In the conditions of satisfying the flow constraint, ensuring the network having sufficient reliability is a very important problem. This paper, which bases on the obtained researches of capacity network whose components have two states, ulteriorly discusses the computation problem of stochastic flow network whose components have several states.The second chapter proposes the stochastic flow network model, the methods of storing and the basic definitions and theories.The third chapter proposes a new method to calculate the reliability of stochastic flow network. This algorithm produces state tree of the network through a given rule, every branch of which is a fully ordered set. Searches each branch while generating the state tree and judges every state according to the method based on path-set. The minimal valid state on every branch is the lower boundary point of the network. Then we find out all the lower boundary points directly and these lower points are disjoint. So we can omit the process of disjointing and calculate the reliability of the network directly. We validate the validity of the algorithm through example.Some reliability-preserving reduction rules for stochastic flow network model are proposed based on the reduction rules of two states network model in the fourth chapter. The reliability computing of stochastic flow network model is a very complex problem. We can make the computation easier by using the given reduction rules in this chapter.