Routing policy of stochastic-flow networks under time threshold and budget constraint

Yi-Kuei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


The quickest path problem is to find a path which sends a given amount of data from the source to the sink such that the transmission time is minimized. More specifically, the capacity of each arc in the 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 as stochastic-flow network. Hence, the minimum transmission time is not a fixed number. The purpose of this paper is to provide a decision procedure for a stochastic-flow network under the time and budget constraints. We try to evaluate the probability that d units of data can be sent through the network under both time threshold and budget according to the routing policy. Such a probability is named the system reliability, which is a performance index to measure the system quality. An efficient algorithm is proposed to derive the optimal routing policy with highest system reliability. The sensitive analysis can be conducted to improve the most important component which increases the system reliability most significantly.

Original languageEnglish
Pages (from-to)6076-6081
Number of pages6
JournalExpert Systems with Applications
Issue number3 PART 2
StatePublished - 1 Apr 2009


  • Priority
  • Routing policy
  • Stochastic-flow network
  • System reliability
  • Time threshold

Fingerprint Dive into the research topics of 'Routing policy of stochastic-flow networks under time threshold and budget constraint'. Together they form a unique fingerprint.

Cite this