Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

System reliability for joint minimal paths under time constraint

System reliability for joint minimal paths under time constraint The quickest path in a transmission problem for a multistate flow network is considered in this article. In this problem, a given amount of data is transmitted to the destination through multiple minimal paths (MPs) simultaneously, and the probability of complete transmission within a time constraint is of interest. In particular, the MPs are joint such that a constriction occurs. An algorithm is developed by applying Monte Carlo simulation to find the system reliability. Furthermore, the proposed algorithm can be used to manage situations with either joint or disjoint MPs. Although the system reliability obtained from this algorithm is an approximate value, the experiments and inference statistics indicate that the expected value is very close to the actual system reliability. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the Chinese Institute of Engineers Taylor & Francis

System reliability for joint minimal paths under time constraint

12 pages

Loading next page...
 
/lp/taylor-francis/system-reliability-for-joint-minimal-paths-under-time-constraint-OVGUqSxjcf

References (22)

Publisher
Taylor & Francis
Copyright
Copyright The Chinese Institute of Engineers
ISSN
2158-7299
eISSN
0253-3839
DOI
10.1080/02533839.2012.747250
Publisher site
See Article on Publisher Site

Abstract

The quickest path in a transmission problem for a multistate flow network is considered in this article. In this problem, a given amount of data is transmitted to the destination through multiple minimal paths (MPs) simultaneously, and the probability of complete transmission within a time constraint is of interest. In particular, the MPs are joint such that a constriction occurs. An algorithm is developed by applying Monte Carlo simulation to find the system reliability. Furthermore, the proposed algorithm can be used to manage situations with either joint or disjoint MPs. Although the system reliability obtained from this algorithm is an approximate value, the experiments and inference statistics indicate that the expected value is very close to the actual system reliability.

Journal

Journal of the Chinese Institute of EngineersTaylor & Francis

Published: Jan 1, 2014

Keywords: joint minimal paths; Monte Carlo simulation; multistate flow network; quickest path

There are no references for this article.