Abstract
Reducing the transmission time for a flow network is an essential task. The quickest path problem thus arises to find a path with minimum transmission time. More specifically, the capacity of each arc in the network is assumed to be deterministic. Nevertheless, the capacity of each arc is stochastic due to failure, maintenance, etc. Such a network is named as a stochastic-flow network. Hence, the minimum transmission time is not a fixed number. We extend the quickest path problem to a system reliability problem that d units of data are required to be sent from the source to the sink under the time threshold T. The possibility to fulfill such requirements is named as the system reliability. In particular, the data can be transmitted through two disjoint minimal paths simultaneously. A simple algorithm is proposed to generate all lower boundary points for ( d, T) and the system reliability can be subsequently computed in terms of such points. Moreover, the optimal pair of paths with highest system reliability can be further obtained.
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 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.
