A fast algorithm for calculating CBP in large-scale sharing resource networks

摘要

The call blocking probability (CBP) is one of the major parameters imposed to describe the quality of service (QOS) in network, and it is widely used to every kinds of network for all customers. With the increasing of network scale, conventional Kaufman recursion method and Convolution method are un-available for data overflow problem in large-scale network. In order to accommodate to large-scale network, Revised Kaufman method and Revised Convolution method introduce a scheme to avoid data overflow, but they have tedious computation time for high computation complexity. A fast algorithm for calculating CBP is proposed in this paper. In large-scale network, the fast algorithm avoids data overflow by introducing a pre-process scheme, and decreases computation complexity by FFT method. Numerical results show that the fast algorithm has reliable accuracy and high speed.