Reliability evaluation of a revised stochastic flow network with uncertain minimum time

Physica A: Statistical Mechanics and its Applications

Volumn 389, Issue 6, 2010, Pages 1253-1258

  Lin, Yi Kuei ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Reliability; Revised stochastic flow networks; Subsets; Time threshold; Uncertain minimum time

Indexed keywords

SET THEORY; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

LOWER BOUNDARY; MINIMAL SYSTEMS; MINIMUM TIME; RELIABILITY EVALUATION; STOCHASTIC CAPACITY; STOCHASTIC FLOW NETWORKS; SYSTEM RELIABILITY; TIME THRESHOLDS;

RELIABILITY;

EID: 72549088500     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2009.11.014     Document Type: Article

References (28)

1. Chen Y.L., and Chin Y.H. The quickest path problem. Computers and Operations Research 17 (1990) 153-161
2. Hung Y.C., and Chen G.H. Distributed algorithms for the quickest path problem. Parallel Computing 18 (1992) 823-834
3. Martins E.D.Q.V., and Santos J.L.E.D. An algorithm for the quickest path problem. Operations Research Letters 20 (1997) 195-198
4. Park C.K., Lee S., and Park S. A label-setting algorithm for finding a quickest path. Computers and Operations Research 31 14 (2004) 2405-2418
5. Chen G.H., and Hung Y.C. Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Computers and Operations Research 21 (1994) 113-118
6. Chen Y.L., and Tang K. Minimum time paths in a network with mixed time constraints. Computers and Operations Research 25 10 (1998) 793-805
7. Chen Y.L. An algorithm for finding the k quickest paths in a network. Computers and Operations Research 20 (1993) 59-65
8. Chen Y.L. Finding the k quickest simples paths in a network. Information Processing Letters 50 (1994) 89-92
9. Clímaco J.C.N., Pascoal M.M.B., Craveirinha J.M.F., and Captivo M.E.V. Internet packet routing: Application of a K-quickest path algorithm. European Journal of Operational Research 181 3 (2007) 1045-1054
10. Pascoal M.M.B., Captivo M.E.V., and Cl'i{dotless}maco J.C.N. An algorithm for ranking quickest simple paths. Computers and Operations Research 32 (2005) 509-520
11. Lee D.T., and Papadopoulou E. The all-pairs quickest path problem. Information Processing Letters 45 (1993) 261-267
12. Huang H., and Feng G. Delay-dependent stability for uncertain stochastic neural network with time-varying delay. Physica A: Statistical Mechanics and its Applications 381 (2007) 93-103
13. Huang H., and Feng G. Corrigendum to Delay-dependent stability for uncertain stochastic neural networks with time-varying delay. Physica A: Statistical Mechanics and its Applications 387 (2008) 1431-1432
14. Wang Z., Lauria S., Fang J., and Liu X. Exponential stability of uncertain stochastic neural networks with mixed time-delays. Chaos, Solitons and Fractals 32 1 (2007) 62-72
15. Wang Z., Fang J., and Liu X. Global stability of stochastic high-order neural networks with discrete and distributed delays. Chaos, Solitons and Fractals 36 2 (2008) 388-396
16. Lin J.S., Jane C.C., and Yuan J. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25 (1995) 131-138
17. Lin Y.K. Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints. IEEE Transactions on Reliability 53 (2004) 381-387
18. Lin Y.K. Reliability evaluation for an information network with node failure under cost constraint. IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans 37 2 (2007) 180-188
19. Xue J. On multistate system analysis. IEEE Transactions on Reliability 34 (1985) 329-337
20. Yeh W.C. An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths. Reliability Engineering and System Safety 92 (2007) 260-268
21. Yeh W.C. A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability. Reliability Engineering and System Safety 93 (2008) 125-136
22. Lin Y.K. Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network. Computers and Operations Research 30 4 (2003) 567-575
23. Jane C.C., Lin J.S., and Yuan J. On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transactions on Reliability 42 (1993) 354-361
24. Lin Y.K. On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint. European Journal of Operational Research 176 (2007) 347-360
25. Yarlagadda R., and Hershey J. Fast algorithm for computing the reliability of communication network. International Journal of Electronics 70 (1991) 549-564
26. Hudson J.C., and Kapur K.C. Reliability bounds for multistate systems with multistate components. Operations Research 33 (1985) 153-160
27. Alexopoulos C. A Note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Transactions on Reliability 44 (1995) 354-357
28. Aven T. Reliability evaluation of multistate systems with multistate components. IEEE Transactions on Reliability 34 (1985) 473-479