在對電信網(wǎng)虛路徑的帶寬分配算法的研究中，羅茂松【3】等人提出了一種單虛路徑條
件下的帶寬分配算法，與典型的“二分法”【1】相比，其優(yōu)點是誤差小，運算速度快，其缺點是運行時間起伏波動大。本文在步進式最優(yōu)算法的基礎(chǔ)上，結(jié)合計算呼叫損失概率(CBP)的單虛路徑近似算法，給出步進式最優(yōu)帶寬分配的快速算法。此快速算法與原有步進式算法相比較，運算速度明顯加快，并克服了步進式算法運行時間起伏波動大的缺點。
關(guān)鍵詞：呼叫損失概率 帶寬分配 服務(wù)質(zhì)量 步進式算法
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