Spare routing problem with p minimal paths for time-based stochastic flow networks

A time-based stochastic flow network (TBSFN), in which each arc has several possible capacities/states and a lead time, is addressed to discuss the system reliability of spare routing for a computer network. The minimum transmission time to send a given amount of data through a single minimal path is uncertain. Although the transmission time will be shortened even if the data are sent through p ( p > 1) disjoint minimal paths simultaneously, it is still variable in a TBSFN. This paper is concerned with evaluating the probability that a specified amount of data can be sent through p minimal paths simultaneously within a time threshold. Such a probability is named the system reliability, which can be treated as a performance index for measuring the transmission ability. We present an efficient methodology to assess the system reliability. Furthermore, a spare routing for boosting the system reliability is established in advance to indicate the main and spare p minimal paths. Subsequently, the system reliability of the spare routing can be computed easily, which shows the contribution of the spare design. From the viewpoint of decision support, we may conduct the sensitive analysis to find out the most important arc which will increase/decrease the system reliability most significantly.