Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability

Yi-Kuei Lin*, Cheng Fu Huang

*Corresponding author for this work

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1020-1035
Number of pages16
JournalInternational Journal of Systems Science
Volume46
Issue number6
DOIs
StatePublished - 26 Apr 2015

Keywords

  • multi-state computer network (MSCN)
  • routing scheme
  • spare reliability
  • tolerable packet unreliability
  • transmission time

Fingerprint Dive into the research topics of 'Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability'. Together they form a unique fingerprint.

Cite this