Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints

In a real-time computer network, arcs and nodes have multi-state capacity, lead time, and packet accuracy rate (PAR). Evaluating the reliability of a network whose nodes are imperfect is complex, because node failure results in the disablement of adjacent arcs. Such a network is named a stochastic imperfect-node computer network (SINCN). Under the strict assumption that each arc has a deterministic capacity, the quickest path problem is to find a path that sends a specific amount of data with minimum transmission time. Subject to both an assured PAR and time constraints, this paper proposes an efficient algorithm to evaluate the system reliability of an SINCN. Furthermore, a routing scheme is adopted to reinforce the system reliability. Accordingly, reliability based on the routing scheme is calculated. An application of our method on the Taiwan academic network is described to show its impact on the backup reliability for different routing schemes.