On performance evaluation for a multistate network under spare routing

被引：6
作者：
Lin, Yi-Kuei [1 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei 106, Taiwan
来源：
INFORMATION SCIENCES | 2012年 / 203卷
关键词：
Spare routing; Transmission reliability; Multistate network; Performance evaluation; Budget; Time threshold; QUICKEST PATH PROBLEM; STOCHASTIC-FLOW NETWORK; RELIABILITY EVALUATION; MINIMAL PATHS; ALGORITHM; TERMS; OPTIMIZATION; CONSTRAINTS; COMPONENTS; SYSTEMS;
D O I：
10.1016/j.ins.2012.03.016
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper focuses on a multistate network composed of multistate edges to study the relationship between transmission reliability and spare routing. In the network, each edge has several possible capacities and may fail due to failure, maintenance, etc. Hence, the minimum transmission time to send a given amount of data is not a fixed number. The spare routing is a transmission rule which indicates the first and the second priority pairs of minimal paths. The second one takes charge of the transmission duty if the first one is out of order. We evaluate the probability that the required amount of data can be sent through a pair of minimal paths simultaneously under both time threshold and budget constraint. Such a probability is named transmission reliability which can be regarded as a performance index to measure the transmission capability of a multistate network. An efficient solution procedure is thus proposed to generate all lower boundary points meeting the constraints. The transmission reliability is calculated in terms of such points. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码：73 / 82
页数：10
相关论文
共 36 条
[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
1234