摘要
The structure of multistage link systems and the calculation of their blocking probability arediscussed in the paper. The characteristics of SPC digital switching network are specially outlined. Thenby defining the minimum pothset used in network graph, a general algorithm is developed to calculate theblocking probability of a complex network. Compared with traditioanl methods for calculating the block-ing probability, the algorithm derived in this paper is more sirnple, more effective and more easily realizedon computer, and is well worthy of being used practically.
The structure of multistage link systems and the calculation of their blocking probability arediscussed in the paper. The characteristics of SPC digital switching network are specially outlined. Thenby defining the minimum pothset used in network graph, a general algorithm is developed to calculate theblocking probability of a complex network. Compared with traditioanl methods for calculating the block-ing probability, the algorithm derived in this paper is more sirnple, more effective and more easily realizedon computer, and is well worthy of being used practically.
