Series-parallel transformation for diameter constrained network reliability computation

Abstract

The reliability of a network with a diameter constraint is defined as the probabilistic connectivity of each pair of nodes by paths that travel through a limited number of communication channels. The task of diameter constraint network reliability calculation is NP-hard, so it is relevant to use various reduction and decomposition methods. We propose to use a serial-parallel network transformation in the preliminary step before factoring. Further, we develop this approach in order to perform the serial-parallel transformation on each recursive call of the factoring procedure by H. Cancela and L. Petingi. Such reduction allows to greatly reduce network reliability computational time.