By Topic

Efficient bandwidth allocation and call admission control for VBR service using UPC parameters

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

2 Author(s)
Dapeng Wu ; Dept. of Electr. Eng., Polytech. Univ. of Brooklyn, NY, USA ; Chao, H.J.

Provision of quality-of-service (QoS) guarantees is an important and challenging issue in the design of asynchronous transfer mode (ATM) networks. call admission control (CAC) is an integral part of the challenge and is closely related to other aspects of network designs such as traffic characterization and QoS specification. Since the usage parameter control (UPC) parameters are the only standardized traffic characterization, developing efficient CAC schemes based on UPC parameters is significant for the implementation of CAC on ATM switches. We develop a CAC algorithm called TAP (derived from tagged probability) as well as two other CAC algorithms using the UPC parameters. These CAC algorithms are based on our observation that the loss-probability-to-overflow-probability ratio tends to decrease as the number of sources increases. By introducing the loss-probability-to-overflow-probability ratio K, we find that this ratio sheds light on increasing resource utilization while still guaranteeing QoS. Analysis, simulation, and numerical results have shown that the TAP algorithm is simple and efficient

Published in:

INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:3 )

Date of Conference:

21-25 Mar 1999