一种巨型综合业务网呼叫阻塞概率的快速算法

A Fast Algorithm for Calculating the Call Blocking Probabilities in a Huge Integrated Services Network

为计算综合业务网的呼叫阻塞概率 ,将网络视为资源完全共享队列系统。针对巨型资源完全共享队列的特点 ,得到了在服务员总数与顾客到达率按有限的比率都趋于无穷时 ,队列状态概率分布趋向于正态分布这一结论。在此基础上提出了一种适合于计算大规模队列中呼叫阻塞概率的近似方法。与现有算法相比 ,该算法具有计算简单、误差小、速度快的优点。

In order to calculate the call blocking probabilities in an integrated services network, the network is looked upon as a queuing system with fully shared resources. According to the characteristics of a huge queue with fully shared resources, the conclusion is drawn that when both the number of servers and the arriving rate of customers tend to infinity with their ratio limited, the state probabilities of the queue tends to a normal distribution. In the light of this observation, an algorithm is developed to calculate the call blocking probabilities of large scale queuing systems. Compared with the existing algorithms, the new algorithm has the advantages of simple operation, reliable accuracy and high speed.