论文部分内容阅读
在对电信网虚路径的带宽分配算法的研究中,罗茂松等人提出了一种单虚路径条件下的带宽分配算法,与典型的“二分法”相比,其优点是误差小,运算速度快,其缺点是运行时间起伏波动大。本文在步进式最优算法的基础上,结合计算呼叫损失概率(CBP)的单虚路径近似算法,给出步进式最优带宽分配的快速算法。此快速算法与原有步进式算法相比较,运算速度明显加快,并克服了步进式算法运行时间起伏波动大的缺点。
In the study of the bandwidth allocation algorithm of the virtual path of telecommunication network, Luo Maosong et al. Proposed a bandwidth allocation algorithm under single-dummy path. Compared with the typical “dichotomy”, the proposed method has the advantages of small error, Fast, the downside is the ups and downs of run-time fluctuations. In this paper, based on the stepping optimal algorithm, a fast algorithm of stepping optimal bandwidth allocation is given based on the single-virtual path approximation algorithm which calculates the probability of call loss (CBP). Compared with the original stepping algorithm, this fast algorithm accelerates the computing speed obviously and overcomes the shortcomings of the fluctuating fluctuation of the running time of the stepping algorithm.