TY - GEN
T1 - Efficient bandwidth allocation and call admission control for VBR service using UPC parameters
AU - Wu, Dapeng
AU - Chao, H. Jonathan
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0032650775&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032650775&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.1999.751659
DO - 10.1109/INFCOM.1999.751659
M3 - Conference contribution
AN - SCOPUS:0032650775
SN - 0780354176
SN - 9780780354173
T3 - Proceedings - IEEE INFOCOM
SP - 1044
EP - 1052
BT - Proceedings - IEEE INFOCOM'99
T2 - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99
Y2 - 21 March 1991 through 25 March 1991
ER -