TY - JOUR

T1 - System reliability of a stochastic-flow network through two minimal paths under time threshold

AU - Lin, Yi-Kuei

PY - 2010/4/1

Y1 - 2010/4/1

N2 - 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.

AB - 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.

KW - Optimal pair

KW - Quickest path

KW - System reliability

KW - Time threshold

KW - Two minimal paths

UR - http://www.scopus.com/inward/record.url?scp=76049112486&partnerID=8YFLogxK

U2 - 10.1016/j.ijpe.2009.11.033

DO - 10.1016/j.ijpe.2009.11.033

M3 - Article

AN - SCOPUS:76049112486

VL - 124

SP - 382

EP - 387

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 2

ER -