Reliability of $k$ Separate Minimal Paths Under Both Time and Budget Constraints

Abstract

To minimize transmission time, the quickest path problem arises to find a path which sends a given amount of data from the unique source to the unique sink. Two deterministic attributes are involved in this problem: the capacity, and the lead time. However, in many real-life networks such as computer systems, or telecommunication systems, the arc capacity should be multistate due to failure, maintenance, and other such conditions. Such a network is named a multistate flow network, and the minimum transmission time is thus not fixed. We modify the quickest path problem to a multistate case. The new problem is to evaluate the probability that d units of data can be transmitted from the unique source to the unique sink under both the time, and budget constraints. In particular, the data are transmitted through k separate minimal paths simultaneously. Such a probability is named system reliability. An efficient algorithm is proposed to generate all minimal system states fulfilling the demand, time, and budget constraints. The system reliability is subsequently computed in terms of such system states. The optimal k minimal paths with the highest system reliability can further be obtained.