呼损率计算对步进式带宽分配性能的影响

在对电信网虚路径的带宽分配算法的研究中，罗茂松【3】等人提出了一种单虚路径条
件下的带宽分配算法，与典型的“二分法”【1】相比，其优点是误差小，运算速度快，其缺点是运行时间起伏波动大。本文在步进式最优算法的基础上，结合计算呼叫损失概率(CBP)的单虚路径近似算法，给出步进式最优带宽分配的快速算法。此快速算法与原有步进式算法相比较，运算速度明显加快，并克服了步进式算法运行时间起伏波动大的缺点。
关键词：呼叫损失概率 带宽分配 服务质量 步进式算法
Abstract：Luo M.S. presented a step bandwidth allocation algorithm under the condition of single virtual path in the research of virtual path bandwidth allocation management in telecom networks. We can find that step algorithm’s advantage is little error and rapid computing speed and its disadvantage is large fluctuating of computing time under the condition of different deviation coefficients when we compare the step algorithm with bi-section algorithm which is typical. In this article, we present a fast algorithm of step optimal bandwidth allocation with single virtual path approximate algorithm of calculating call blocking probability. we compare the performance of the fast algorithm with that of original step algorithm and conclude that the run speed of the former is quicken obviously and it overcomes the forenamed disadvantage of original step algorithm.
Key words：call blocking probability(CBP) bandwidth allocation quality of service(QoS)
step algorithm