Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(81.02KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
Publications from CSC-OpenAccess Library are being accessed from over 74 countries worldwide.
Reliability Evaluation of Stochastic-Flow Network Under Quickest Path and System Capacity Constraints
Moatamad R. Hassan
Pages - 98 - 103     |    Revised - 15-09-2012     |    Published - 25-10-2012
Volume - 4   Issue - 4    |    Publication Date - October 2012  Table of Contents
MORE INFORMATION
KEYWORDS
Time and Capacity Constraints, Minimal Path, Stochastic-flow Network,, System Reliability.
ABSTRACT
This paper proposes an algorithm to evaluate the probability that d units of data can be sent from the source node to the sink node through a valid group of paths on a network. The conditions of transmission are such that the transmission time of each path belonging to this valid group of paths does not exceed the specified upper bound T, and that the maximal capacity of that path is not less than the specified lower bound Cs (the required system capacity). Such a probability, which is called the system reliability, is denoted by R(d,Cs,T). Based on minimal paths, the algorithm generates all the lower boundary points for (d,Cs,T), and the system reliability can then be calculated in terms of all the lower boundary points for (d,Cs,T) by applying the inclusion-exclusion rule.
CITED BY (3)  
1 Yusuf, I., & Yusuf, B. Reliability Comparison Between Redundant Repairable Network Flow Systems.
2 LIN, Y. K., & HUANG, C. F. (2013). transmission reliability of a stochastic imperfect vertex computer network with packet unreliability and time attributes. International Journal of Reliability, Quality and Safety Engineering, 20(05), 1350018.
3 Lin, Y. K., Yeh, C. T., & Huang, C. F. (2013). Reliability evaluation of a stochastic-flow distribution network with delivery spoilage. Computers & Industrial Engineering, 66(2), 352-359.
1 Google Scholar 
2 CiteSeerX 
3 refSeek 
4 Scribd 
5 PdfSR 
1 JS. Lin, CC. Jane and J. Yuan, “On reliability evaluation of a capacitated-flow network in terms of minimal path sets”, Networks, 25:131-138, 1995.
2 YK. Lin, “A simple algorithm for reliability evaluation of a stochastic-flow network with node failure”, Computers and Operations Research, vol. 28(13):1277-1285, 2001.
3 YK. Lin, “Two-commodity reliability evaluation for a stochastic-flow network with node failure”,Computers & Operations Research, 29(13):1927-1939, 2002.
4 JS. Lin, “Reliability evaluation of capacitated-flow networks with budget constraints “, IIE Transactions, 30(12):1175-1 180, 1998.
5 YK. Lin, “Reliability of a Stochastic-Flow Network With Unreliable Branches and Nodes”, Under Budget Constraints, IEEE Transactions on Reliability, 53(3):381-387, 2004.
6 YK. Lin, “Reliability evaluation for an information network with node failure under cost constraint”,IEEE Transactions on Systems, Man. And Cybernetics, Part A: System and Humans, 37(2):180-188, 2007.
7 YK. Lin, “System Reliability of a Limited-Flow Network in Multicommodity Case”, IEEE Transactions on Reliability, 56(1):17-25, 2007.
8 YK. Lin, “Extend the quickest path problem to the system reliability evaluation for a stochasticflow network”, Computers and Operation Research, 30:567-575, 2003.
9 K. K. Aqqarwal, Y. C. Chopra, and J.S. Bajwa, “Capacity consideration in reliability analysis of communication system”, IEEE Transactions on Reliability, 31(2):177-181, 1982.
10 J. Xue, “On Multistate System Analysis”, IEEE Transactions on Reliability, 34(4):329-337, 1985.
Dr. Moatamad R. Hassan
South Valley University - Egypt
m_r_hassan73@yahoo.com