Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks

• Published in: Journal of statistical computation and simulation Vol. 84; no. 7; pp. 1530 - 1542
• Main Authors: Lin, Yi-Kuei, Huang, Cheng-Fu
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis 03.07.2014; Taylor & Francis Ltd
• Subjects: Accuracy; accuracy rate; Algorithms; Computation; Computer networks; graphic technique; lead time; Magnetic fields; Networks; packet lost; Probability; Quadratic programming; Software reliability; Stochastic models; stochastic unreliable-node computer network; Stochasticity; System reliability; Systems design
• ISSN: 0094-9655; 1563-5163
• DOI: 10.1080/00949655.2012.751988

In many real-life networks such as computer networks, branches and nodes have multi-state capacity, lead time, and accuracy rate. The network with unreliable nodes is more complex to evaluate the reliability because node failure results in the disabled of adjacent branches. Such a network is named a stochastic unreliable-node computer network (SUNCN). Under the strict assumption that each component (branch and node) has a deterministic capacity, the quickest path (QP) problem is to find a path sending a specific amount of data with minimum transmission time. The accuracy rate is a critical index to measure the performance of a computer network because some packets are damaged or lost due to voltage instability, magnetic field effects, lightning, etc. Subject to both assured accuracy rate and time constraints, this paper extends the QP problem to discuss the system reliability of an SUNCN. An efficient algorithm based on a graphic technique is proposed to find the minimal capacity vector meeting such constraints. System reliability, the probability to send a specific amount of data through multiple minimal paths subject to both assured accuracy rate and time constraints, can subsequently be computed.