RELIABILITY EVALUATION OF A MULTISTATE NETWORK UNDER ROUTING POLICY

被引:0
作者
Lin, Yi-Kuei [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
来源
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE | 2012年 / 19卷 / 02期
关键词
Multistate network; commodity transmission; system reliability; transmission time; routing policy; QUICKEST PATH PROBLEM; STOCHASTIC-FLOW NETWORK; CAPACITY WEIGHT; ALGORITHM; SYSTEM; OPTIMIZATION; CONSTRAINTS; COMPONENTS; TERMS; NODES;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A multistate network is a stochastic network composed with multistate arcs in which each arc has several possible capacities and may fail due to failure, maintenance, etc. Different from the deterministic case, the minimum transmission time in a multistate network is not a fixed number. We evaluate the probability that a given amount of data/commodity can be sent from a source port to a sink port through a pair of minimal path (MP) simultaneously under the time constraint. Such a probability is named the system reliability. An efficient solution procedure is first proposed to calculate it. In order to enhance the system reliability, the network administrator decides the routing policy in advance to indicate the first and the second priority pairs of MP. Subsequently, we can evaluate the system reliability under the routing policy. An easy criterion is then proposed to derive an ideal routing policy with higher system reliability. We can treat the system reliability as a performance index to measure the transmission ability of a multistate network such as computer, logistics, urban traffic, telecommunication systems, etc.
引用
收藏
页码:57 / 67
页数:11
相关论文
共 30 条
[1]  
Ahuja R.K., 1998, COMPUTERS OPERATIONS, V16, P83
[2]   A NOTE ON STATE-SPACE DECOMPOSITION METHODS FOR ANALYZING STOCHASTIC FLOW NETWORKS [J].
ALEXOPOULOS, C .
IEEE TRANSACTIONS ON RELIABILITY, 1995, 44 (02) :354-357
[3]   RELIABILITY EVALUATION OF MULTISTATE SYSTEMS WITH MULTISTATE COMPONENTS [J].
AVEN, T .
IEEE TRANSACTIONS ON RELIABILITY, 1985, 34 (05) :473-479
[4]  
BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[5]   ALGORITHMS FOR THE CONSTRAINED QUICKEST PATH PROBLEM AND THE ENUMERATION OF QUICKEST PATHS [J].
CHEN, GH ;
HUNG, YC .
COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (02) :113-118
[6]   ON THE QUICKEST PATH PROBLEM [J].
CHEN, GH ;
HUNG, YC .
INFORMATION PROCESSING LETTERS, 1993, 46 (03) :125-128
[7]   FINDING THE K QUICKEST SIMPLE PATHS IN A NETWORK [J].
CHEN, YL .
INFORMATION PROCESSING LETTERS, 1994, 50 (02) :89-92
[8]   THE QUICKEST PATH PROBLEM [J].
CHEN, YL ;
CHIN, YH .
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (02) :153-161
[9]   AN ALGORITHM FOR FINDING THE K-QUICKEST PATHS IN A NETWORK [J].
CHEN, YL .
COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (01) :59-65
[10]   Minimum time paths in a network with mixed time constraints [J].
Chen, YL ;
Tang, KW .
COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (10) :793-805