An approximate bandwidth evaluation algorithm with application to virtual path bandwidth allocation

In the solution procedure of virtual-path bandwidth allocation problem, the current searching algorithms include the process of bandwidth calculation through CBP and traffic load. This is an inverse process of calculating the CBP through traffic load and bandwidth. Because there is no strict expression of calculating CBP, the process of calculating bandwidth through CBP and traffic load adopts the iteration algorithm in common. It limits the computing speed by a long way. Therefore, a fast bandwidth algorithm is proposed and applied to the problem of bandwidth allocation, which aims at minimizing the worst call blocking probabilities in the network. This algorithm is proved to be accurate and fast. Finally, we provide the comparison curves for the exact optimal CBPs in the case of using OPBM and DCLPBM with the approximate fast bandwidth evaluation algorithm.