【摘要】 在对电信网虚路径的带宽分配算法的研究中,罗茂松等人提出了一种单虚路径条件下的带宽分配算法,与典型的“二分法”相比,其优点是误差小,运算速度快,其缺点是运行时间起伏波动大。本文在步进式最优算法的基础上,结合计算呼叫损失概率(CBP)的单虚路径近似算法,给出步进式最优带宽分配的快速算法。此快速算法与原有步进式算法相比较,运算速度明显加快,并克服了步进式算法运行时间起伏波动大的缺点。更多还原

【Abstract】 Luo M.S. presented a step bandwidth allocation algo-rithm under the condition of single virtual path in the researchof virtual path bandwidth allocation management in telecom net-works. We can find that step algorithm’ s advantage is little er-ror and rapid computing speed and its disadvantage is largefluctuating of computing time under the condition of different de-viation coefficients when we compare the step algorithm with bi-section algorithm which is typical. In this article, we present afast algorithm of step optimal bandwidth allocation with singlevirtual path approximate algorithm of calculating call blockingprobability. we compare the performance of the fast algorithmwith that of original step algorithm and conclude that the runspeed of the former is quicken obviously and it overcomes theforenamed disadvantage of original step algorithm.更多还原