Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate

Yi-Kuei Lin*, Cheng Fu Huang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In many real-time networks such as computer networks, each arc has stochastic capacity, lead time, and accuracy rate. Such a network is named a multi-state computer network (MSCN). Under the strict assumption that the capacity of each arc is deterministic, the quickest path (QP) problem is to find a path that sends a specific amount of data with minimum transmission time. From the viewpoint of internet quality, the transmission accuracy rate is one of critical performance indicators to assess internet network for system administrators and customers. Under both assured accuracy rate and time constraint, this paper extends the QP problem to discuss the flow assignment for a MSCN. An efficient algorithm is proposed to find the minimal capacity vector meeting such requirements. The system reliability, the probability to send d units of data through multiple minimal paths under both assured accuracy rate and time constraint, can subsequently be computed. Furthermore, two routing schemes with spare minimal paths are adopted to reinforce the system reliability. The enhanced system reliability according to the routing scheme is calculated as well. The computational complexity in both the worst case and average case are analyzed.

Original languageEnglish
Pages (from-to)221-240
Number of pages20
JournalAnnals of Operations Research
Volume244
Issue number1
DOIs
StatePublished - 1 Sep 2016

Keywords

  • Assured accuracy rate
  • Multi-state computer network (MSCN)
  • Quickest path (QP)
  • Routing scheme
  • System reliability
  • Transmission time

Fingerprint Dive into the research topics of 'Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate'. Together they form a unique fingerprint.

Cite this