By Topic

Bandwidth allocation and routing in virtual path based 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 $13
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)
E. W. M. Wong ; Dept. of Electron. Eng., City Univ. of Hong Kong, Kowloon, Hong Kong ; A. K. M. Chan ; S. C. H. Chan ; K. T. Ko

The virtual path (VP) concept in ATM networks simplifies traffic control and resource management. For bandwidth allocation, a VP can carry traffic of the same type (the separated scheme) or of different types (the unified scheme) if the most stringent quality of service (QoS) amongst traffic of different types is used on the VP. In addition, VP capacity is dynamically adjusted in a predetermined incremental size. In this paper, we study a least loaded path-based adaptive routing algorithm called maximum free circuit routing under two bandwidth allocation schemes, in an ATM network employing the VP concept. In particular, we evaluate the call blocking probability and the call set-up processing load with varying bandwidth incremental sizes. It is found numerically how the use of VP trades the blocking probability for call setup processing load. It is also found that the unified scheme could outperform the separated scheme with the use of VP

Published in:

Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on  (Volume:2 )

Date of Conference:

23-27 Jun 1996