TY - JOUR
T1 - Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
AU - Lin, Yi-Kuei
AU - Huang, Cheng Fu
PY - 2015/4/26
Y1 - 2015/4/26
N2 - From a quality of service viewpoint, the transmission packet unreliability and transmission time are both critical performance indicators in a computer system when assessing the Internet quality for supervisors and customers. A computer system is usually modelled as a network topology where each branch denotes a transmission medium and each vertex represents a station of servers. Almost every branch has multiple capacities/states due to failure, partial failure, maintenance, etc. This type of network is known as a multi-state computer network (MSCN). This paper proposes an efficient algorithm that computes the system reliability, i.e., the probability that a specified amount of data can be sent through k (k ≥ 2) disjoint minimal paths within both the tolerable packet unreliability and time threshold. Furthermore, two routing schemes are established in advance to indicate the main and spare minimal paths to increase the system reliability (referred to as spare reliability). Thus, the spare reliability can be readily computed according to the routing scheme.
AB - From a quality of service viewpoint, the transmission packet unreliability and transmission time are both critical performance indicators in a computer system when assessing the Internet quality for supervisors and customers. A computer system is usually modelled as a network topology where each branch denotes a transmission medium and each vertex represents a station of servers. Almost every branch has multiple capacities/states due to failure, partial failure, maintenance, etc. This type of network is known as a multi-state computer network (MSCN). This paper proposes an efficient algorithm that computes the system reliability, i.e., the probability that a specified amount of data can be sent through k (k ≥ 2) disjoint minimal paths within both the tolerable packet unreliability and time threshold. Furthermore, two routing schemes are established in advance to indicate the main and spare minimal paths to increase the system reliability (referred to as spare reliability). Thus, the spare reliability can be readily computed according to the routing scheme.
KW - multi-state computer network (MSCN)
KW - routing scheme
KW - spare reliability
KW - tolerable packet unreliability
KW - transmission time
UR - http://www.scopus.com/inward/record.url?scp=84918787409&partnerID=8YFLogxK
U2 - 10.1080/00207721.2013.807383
DO - 10.1080/00207721.2013.807383
M3 - Article
AN - SCOPUS:84918787409
VL - 46
SP - 1020
EP - 1035
JO - International Journal of Systems Science
JF - International Journal of Systems Science
SN - 0020-7721
IS - 6
ER -