Premium
Reliability of a Multi‐State Computer Network Through k Minimal Paths Within Tolerable Error Rate and Time Threshold
Author(s) -
Lin YiKuei,
Huang ChengFu
Publication year - 2016
Publication title -
quality and reliability engineering international
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 62
eISSN - 1099-1638
pISSN - 0748-8017
DOI - 10.1002/qre.1840
Subject(s) - reliability (semiconductor) , transmission (telecommunications) , computer science , state (computer science) , failure rate , reliability engineering , data transmission , vertex (graph theory) , algorithm , mathematical optimization , real time computing , mathematics , computer network , theoretical computer science , engineering , telecommunications , power (physics) , graph , physics , quantum mechanics
A computer system is usually modeled as a network topology where each branch denotes a transmission medium and each vertex represents a station of servers. Each branch has multiple capacities/states due to failure, partial failure, and maintenance. Such a network is named a multi‐state computer network (MSCN). From the viewpoint of quality management, transmission error rate and transmission time are both critical performance indicators to assess Internet quality for system managers and customers. Within both tolerable error rate and time threshold, the addressed problem is concentrated on an MSCN for computing the probability that d units of data can be sent through multiple minimal paths simultaneously. Such a probability is named system reliability. A solution procedure including an efficient algorithm based on MPs is proposed to derive the lower boundary vectors (LBVs) meeting the requirements. Then system reliability, which is represented as the probability of union of subsets, can be subsequently evaluated by the LBVs. Copyright © 2015 John Wiley & Sons, Ltd.