Research on the calculation of call blocking probability in large-scale multimedia network

The call blocking probability (CBP) is one of the major parameters imposed to describe the quality of service (QoS) in network. With the rapid increasing of network scale, conventional Kaufman recursion method and convolution method are unsuccessful for data overflow problem in large-scale multimedia network. In order to accommodate to large-scale multimedia network, revised Kaufman method and revised convolution introduce normalization scheme to avoid data overflow, but they both have tedious computation time for high computation complexity. A fast algorithm for calculating CBP is proposed in this paper. In large-scale multimedia network, the fast algorithm overcomes data overflow problem by introducing a pre-process scheme, and effectively decreases computation complexity by FFT method. Numerical results show that the fast algorithm has reliable accuracy and high speed