An Upper Bound on Bandwidth Requirement and Its Applications to Traffic Control in ATM Networks

Piya TANTHAWICHIAN; Akihiro FUJII; Yoshiaki NEMOTO

An Upper Bound on Bandwidth Requirement and Its Applications to Traffic Control in ATM Networks

Piya TANTHAWICHIAN, Akihiro FUJII, Yoshiaki NEMOTO

Full Text Views

0

Cite this

Summary :

Major problems of traffic control in ATM networks include how to decide whether a network accepts a new call or not in real time and how to select the best set of Dual Leaky Bucket (DLB) parameter values. To solve these problems, it is necessary to determine the amount of network bandwidth required by the call. In this paper, we present an analysis based on bounding technique to derive an upper bound on bandwidth requirement when the call is characterized by a set of DLB parameters. Consequently, a new definition of the upper bound on bandwidth requirement and simple formulae used for computing the upper bound have been obtained. To clarify the advantages of the derived upper bound, we demonstrate its two applications, one to select the best set of DLB parameter values from candidates for minimizing the amount of bandwidth to be allocated to the call and the other to establish a Connection Admission Control (CAC) scheme. The upper bound-based CAC scheme is fast enough to process in real time due to its simplicity and provides a significant improvement of network utilization compared to the peak rate-based CAC scheme.

Publication: IEICE TRANSACTIONS on Communications Vol.E81-B No.12 pp.2371-2379

Publication Date: 1998/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on the Latest Development of Telecommunication Research)

Category: QoS Control and Traffic Control

Cite this

Copy

Piya TANTHAWICHIAN, Akihiro FUJII, Yoshiaki NEMOTO, "An Upper Bound on Bandwidth Requirement and Its Applications to Traffic Control in ATM Networks" in IEICE TRANSACTIONS on Communications, vol. E81-B, no. 12, pp. 2371-2379, December 1998, doi: .
Abstract: Major problems of traffic control in ATM networks include how to decide whether a network accepts a new call or not in real time and how to select the best set of Dual Leaky Bucket (DLB) parameter values. To solve these problems, it is necessary to determine the amount of network bandwidth required by the call. In this paper, we present an analysis based on bounding technique to derive an upper bound on bandwidth requirement when the call is characterized by a set of DLB parameters. Consequently, a new definition of the upper bound on bandwidth requirement and simple formulae used for computing the upper bound have been obtained. To clarify the advantages of the derived upper bound, we demonstrate its two applications, one to select the best set of DLB parameter values from candidates for minimizing the amount of bandwidth to be allocated to the call and the other to establish a Connection Admission Control (CAC) scheme. The upper bound-based CAC scheme is fast enough to process in real time due to its simplicity and provides a significant improvement of network utilization compared to the peak rate-based CAC scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_12_2371/_p

Copy

@ARTICLE{e81-b_12_2371,
author={Piya TANTHAWICHIAN, Akihiro FUJII, Yoshiaki NEMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={An Upper Bound on Bandwidth Requirement and Its Applications to Traffic Control in ATM Networks},
year={1998},
volume={E81-B},
number={12},
pages={2371-2379},
abstract={Major problems of traffic control in ATM networks include how to decide whether a network accepts a new call or not in real time and how to select the best set of Dual Leaky Bucket (DLB) parameter values. To solve these problems, it is necessary to determine the amount of network bandwidth required by the call. In this paper, we present an analysis based on bounding technique to derive an upper bound on bandwidth requirement when the call is characterized by a set of DLB parameters. Consequently, a new definition of the upper bound on bandwidth requirement and simple formulae used for computing the upper bound have been obtained. To clarify the advantages of the derived upper bound, we demonstrate its two applications, one to select the best set of DLB parameter values from candidates for minimizing the amount of bandwidth to be allocated to the call and the other to establish a Connection Admission Control (CAC) scheme. The upper bound-based CAC scheme is fast enough to process in real time due to its simplicity and provides a significant improvement of network utilization compared to the peak rate-based CAC scheme.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - An Upper Bound on Bandwidth Requirement and Its Applications to Traffic Control in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2371
EP - 2379
AU - Piya TANTHAWICHIAN
AU - Akihiro FUJII
AU - Yoshiaki NEMOTO
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1998
AB - Major problems of traffic control in ATM networks include how to decide whether a network accepts a new call or not in real time and how to select the best set of Dual Leaky Bucket (DLB) parameter values. To solve these problems, it is necessary to determine the amount of network bandwidth required by the call. In this paper, we present an analysis based on bounding technique to derive an upper bound on bandwidth requirement when the call is characterized by a set of DLB parameters. Consequently, a new definition of the upper bound on bandwidth requirement and simple formulae used for computing the upper bound have been obtained. To clarify the advantages of the derived upper bound, we demonstrate its two applications, one to select the best set of DLB parameter values from candidates for minimizing the amount of bandwidth to be allocated to the call and the other to establish a Connection Admission Control (CAC) scheme. The upper bound-based CAC scheme is fast enough to process in real time due to its simplicity and provides a significant improvement of network utilization compared to the peak rate-based CAC scheme.
ER -