Abstract
The quickest path problem, a version of the shortest path problem, is to find a single quickest path that sends a given amount of data from the source to the sink with minimum transmission time. More specifically, the capacity of each arc in a network is assumed to be deterministic. However, in many real-life networks, such as computer systems, telecommunication systems, etc., the capacity of each arc is stochastic due to failure, maintenance, etc. Such a network is named a stochastic-flow network. Therefore, the minimum transmission time is not a fixed number. The transmission time can be reduced if the data are transmitted through several minimal paths simultaneously. Focusing on a stochastic flow network with multistate arcs, this article studies the stochastic quickest path problem. We evaluate the probability that d units of data can be sent through two minimal paths (MPs) simultaneously under time constraint T. Such a probability is named the system reliability. A simple algorithm is proposed to generate all (d, T)-MPs and the system reliability can then be computed in terms of (d, T)-MPs by applying inclusion–exclusion.
Sign-in/Register to access full text options 
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 callMore From: Journal of the Chinese Institute of Industrial Engineers
Disclaimer: 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.
