TY - JOUR
T1 - Efficient bandwidth allocation and call admission control for VBR service using UPC parameters
AU - Wu, Dapeng
AU - Chao, H. Jonathan
PY - 2000/2
Y1 - 2000/2
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 characterizations, developing efficient CAC schemes based on UPC parameters is significant for the implementation of CAC on ATM switches. In this paper, 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 proposed 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 characterizations, developing efficient CAC schemes based on UPC parameters is significant for the implementation of CAC on ATM switches. In this paper, 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 proposed TAP algorithm is simple and efficient.
UR - http://www.scopus.com/inward/record.url?scp=0034134633&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034134633&partnerID=8YFLogxK
U2 - 10.1002/(SICI)1099-1131(200002)13:1<29::AID-DAC405>3.0.CO;2-Z
DO - 10.1002/(SICI)1099-1131(200002)13:1<29::AID-DAC405>3.0.CO;2-Z
M3 - Article
AN - SCOPUS:0034134633
SN - 1074-5351
VL - 13
SP - 29
EP - 50
JO - International Journal of Communication Systems
JF - International Journal of Communication Systems
IS - 1
ER -