Abstract
For a stochastic and directed capacitated-flow network in which the capacity of each arc has several possible values, this article generalizes the system reliability problem from single source node and single sink node cases to an overall-terminal case. Given the demand for each node pair simultaneously, a simple algorithm is proposed first to generate all lower boundary points for such demands in terms of minimal paths. The lower boundary point is a vector denoting the current capacity of each arc. The system reliability, the probability that the system satisfies the demands simultaneously, can be calculated in terms of such lower boundary points by applying the inclusion-exclusion method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
