By Topic

Two-level dynamic step sizes of virtual paths on bandwidth allocation in ATM networks

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
$33 $33
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

3 Author(s)
J. -L. C. Wu ; Dept. of Electron. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; L. -D. Chou ; S. -J. Tzeng

The virtual path concept has been proposed as the key technique in improving the transmission efficiency in ATM networks. Changing the bandwidth of a virtual path, by a step at a time, has been shown to successfully enhance the transmission efficiency compared to the fixed bandwidth scheme. Therefore how to appropriately select a step size which causes a trade-off between the transmission efficiency and the normalised processing load, becomes an important issue. The authors propose a flexible and effective bandwidth control algorithm, which is capable of dynamically selecting a proper step size according to traffic types, network conditions, and the bandwidth-demand factor of each traffic type. Performance measures of the network, using this dynamic bandwidth-allocation scheme are analysed. Two examples are provided for illustration. The first shows that the proposed algorithm is capable of improving the transmission efficiency, even compared to the scheme with optimal fixed step size. The other shows that the normalised processing loads of both traffic types are significantly reduced without degradation in transmission efficiency

Published in:

IEE Proceedings - Communications  (Volume:142 ,  Issue: 3 )