摘要
Because of no strict expression of calculating call blocking probability （CBP） in the solution procedure of virtual-path bandwidth allocation problem, the process of calculating bandwidth through CBP and traffic load adopts the iteration algorithm in common, which is an inverse process of calculating CBP through traffic load and bandwidth. It limits computing speed by a long way because of including recursion. An approximate algorithm of bandwidth is presented. We compare the performance of this algorithm with that of another classical algorithm and conclude that the former makes a great increase in speed with little error about 2 %.
Because of no strict expression of calculating call blocking probability （CBP） in the solution procedure of virtual-path bandwidth allocation problem, the process of calculating bandwidth through CBP and traffic load adopts the iteration algorithm in common, which is an inverse process of calculating CBP through traffic load and bandwidth. It limits computing speed by a long way because of including recursion. An approximate algorithm of bandwidth is presented. We compare the performance of this algorithm with that of another classical algorithm and conclude that the former makes a great increase in speed with little error about 2 %.
基金
This project was supported by National Natural Science Foundation of China (69972015)
Guangdong Provincial NationalScience Foundation (31391) .
