Evaluating the reliability of a novel deterioration-effect multi-state flow network

被引:22
作者
Yeh, Wei-Chang [1 ,2 ]
机构
[1] Univ Technol Sydney, Adv Analyt Inst, Integrat & Collaborat Lab, Broadway, NSW 2007, Australia
[2] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu 300, Taiwan
关键词
Multi-state flow network reliability; Minimal path; Deterioration effect; Flow conservation law; MINIMAL PATHS; UNRELIABLE NODES; SYSTEMS; ALGORITHM; SEARCH; COMPONENTS; TERMS;
D O I
10.1016/j.ins.2013.02.016
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In a traditional multi-state flow network (MFN), the flow values into and out of any arc are assumed to be equal. In practical application, however, the flow may undergo a loss due to deterioration. For example, electrical power will decrease if the transmission distance is too great. Hence, a novel MFN model called the deterioration-effect MFN (MFNde) is proposed to address this real world problem. A straightforward and simple algorithm based on a novel concept called the deterioration-effect d-minimal path (d-MPde) is presented to evaluate the reliability of an MFNde, which is defined as the probability that at least d units of data can be received by the sink node through the MFNde. The computational complexity of the proposed algorithm is also analyzed. Finally, an example is presented to illustrate how the reliability of an MFNde is calculated using the proposed algorithm. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:75 / 85
页数:11
相关论文
共 28 条
[11]   Reliability of multi-state systems with common bus performance sharing [J].
Levitin, Gregory .
IIE TRANSACTIONS, 2011, 43 (07) :518-524
[12]   RELIABILITY EVALUATION OF A CAPACITATED-FLOW NETWORK IN TERMS OF MINIMAL PATHSETS [J].
LIN, JS ;
JANE, CC ;
YUAN, J .
NETWORKS, 1995, 25 (03) :131-138
[13]   On performance evaluation for a multistate network under spare routing [J].
Lin, Yi-Kuei .
INFORMATION SCIENCES, 2012, 203 :73-82
[14]   Computer network reliability optimization under double-resource assignments subject to a transmission budget [J].
Lin, Yi-Kuei ;
Yeh, Cheng-Ta .
INFORMATION SCIENCES, 2011, 181 (03) :582-599
[15]   A method to evaluate routing policy through p minimal paths for stochastic case [J].
Lin, Yi-Kuei .
INFORMATION SCIENCES, 2010, 180 (23) :4595-4605
[16]  
Rausand M., 2004, SYSTEM RELIABILITY T
[17]   AN EFFICIENT ALGORITHM FOR SIMULTANEOUSLY DEDUCING MINIMAL PATHS AS WELL AS CUTS OF A COMMUNICATION-NETWORK [J].
SAMAD, MA .
MICROELECTRONICS AND RELIABILITY, 1987, 27 (03) :437-441
[18]  
XUE J, 1985, RELIAB ENG SYST SAFE, V10, P245, DOI 10.1016/0143-8174(85)90008-3
[19]   A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance [J].
Yeh, WC .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (10) :1235-1240
[20]   A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network [J].
Yeh, WC .
IEEE TRANSACTIONS ON RELIABILITY, 1998, 47 (04) :436-442