Stochastic flow networks via multiple paths under time threshold and budget constraint

Yi-Kuei Lin*

*Corresponding author for this work

研究成果: Article同行評審

7 引文 斯高帕斯(Scopus)

摘要

This paper extends the quickest path problem to a stochastic flow network in which the capacity of each arc is variable. We mainly evaluate the system reliability that d units of data can be sent from the source to the sink under both time threshold T and budget B. In particular, the data are transmitted through multiple disjoint minimal paths simultaneously in order to reduce the transmission time. A simple algorithm is proposed to generate all lower boundary points for (d,T,B), and the system reliability can then be computed in terms of such points by utilizing a union of subsets. Computational complexity in both worst case and average cases show that the proposed algorithm can be executed efficiently.

原文English
頁(從 - 到)2629-2638
頁數10
期刊Computers and Mathematics with Applications
62
發行號6
DOIs
出版狀態Published - 1 九月 2011

指紋 深入研究「Stochastic flow networks via multiple paths under time threshold and budget constraint」主題。共同形成了獨特的指紋。

引用此