By Topic

New bandwidth algorithm and its performance analysis in integrated service network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hui, Song ; Dept. of Electronic Communications, South China Univ. of Technology, Guangzhou 510641, P. R. China ; Wu, Ye ; Suili, Feng ; Shengye, Huang

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%.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:16 ,  Issue: 3 )