Bound on Waiting Time for Multiplexing Traffic Enforced/Shaped by GCRA in ATM Networks

Fang-Chang KUO

Bound on Waiting Time for Multiplexing Traffic Enforced/Shaped by GCRA in ATM Networks

Fang-Chang KUO

Full Text Views

0

Cite this

Summary :

The ATM Forum recommends the use of the Generic Cell Rate Algorithm (GCRA) to perform Usage Parameter Control at the User Network Interface of ATM networks. In order to facilitate the Call Admission Control and resource allocation procedure, it is important to investigate the characteristics of the model in which GCRA-enforced sources are merged together by a multiplexer. Such a multiplexer could be the one arranged in front of a switch to concentrate user traffic and reduce the number of required input ports. It may also represent the logical multiplexer at the output port of a switch that collects cells routed from various input ports. Moreover, it may represent the service function of the edge router situated between the integrated-services (IntServ) networks and the backbone networks that provide differentiated-services (DiffServ). In this paper, the environment under discussion is a multiplexer in which every traffic source is enforced by a dual-stage GCRA enforcer before being merged. The worst traffic pattern that maximizes the average waiting time in the multiplexer is found. The maximum average waiting time is deduced and expressed as a function of the GCRA parameters and the number of multiplexed sources. In particular, the analysis considers the speed-up function, which is widely used for ATM multiplexers and switches. The results can also be applied to a GCRA shaper without any modification.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.7 pp.1931-1938

Publication Date: 2004/07/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Fundamental Theories

Cite this

Copy

Fang-Chang KUO, "Bound on Waiting Time for Multiplexing Traffic Enforced/Shaped by GCRA in ATM Networks" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 7, pp. 1931-1938, July 2004, doi: .
Abstract: The ATM Forum recommends the use of the Generic Cell Rate Algorithm (GCRA) to perform Usage Parameter Control at the User Network Interface of ATM networks. In order to facilitate the Call Admission Control and resource allocation procedure, it is important to investigate the characteristics of the model in which GCRA-enforced sources are merged together by a multiplexer. Such a multiplexer could be the one arranged in front of a switch to concentrate user traffic and reduce the number of required input ports. It may also represent the logical multiplexer at the output port of a switch that collects cells routed from various input ports. Moreover, it may represent the service function of the edge router situated between the integrated-services (IntServ) networks and the backbone networks that provide differentiated-services (DiffServ). In this paper, the environment under discussion is a multiplexer in which every traffic source is enforced by a dual-stage GCRA enforcer before being merged. The worst traffic pattern that maximizes the average waiting time in the multiplexer is found. The maximum average waiting time is deduced and expressed as a function of the GCRA parameters and the number of multiplexed sources. In particular, the analysis considers the speed-up function, which is widely used for ATM multiplexers and switches. The results can also be applied to a GCRA shaper without any modification.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_7_1931/_p

Copy

@ARTICLE{e87-b_7_1931,
author={Fang-Chang KUO, },
journal={IEICE TRANSACTIONS on Communications},
title={Bound on Waiting Time for Multiplexing Traffic Enforced/Shaped by GCRA in ATM Networks},
year={2004},
volume={E87-B},
number={7},
pages={1931-1938},
abstract={The ATM Forum recommends the use of the Generic Cell Rate Algorithm (GCRA) to perform Usage Parameter Control at the User Network Interface of ATM networks. In order to facilitate the Call Admission Control and resource allocation procedure, it is important to investigate the characteristics of the model in which GCRA-enforced sources are merged together by a multiplexer. Such a multiplexer could be the one arranged in front of a switch to concentrate user traffic and reduce the number of required input ports. It may also represent the logical multiplexer at the output port of a switch that collects cells routed from various input ports. Moreover, it may represent the service function of the edge router situated between the integrated-services (IntServ) networks and the backbone networks that provide differentiated-services (DiffServ). In this paper, the environment under discussion is a multiplexer in which every traffic source is enforced by a dual-stage GCRA enforcer before being merged. The worst traffic pattern that maximizes the average waiting time in the multiplexer is found. The maximum average waiting time is deduced and expressed as a function of the GCRA parameters and the number of multiplexed sources. In particular, the analysis considers the speed-up function, which is widely used for ATM multiplexers and switches. The results can also be applied to a GCRA shaper without any modification.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Bound on Waiting Time for Multiplexing Traffic Enforced/Shaped by GCRA in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1931
EP - 1938
AU - Fang-Chang KUO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2004
AB - The ATM Forum recommends the use of the Generic Cell Rate Algorithm (GCRA) to perform Usage Parameter Control at the User Network Interface of ATM networks. In order to facilitate the Call Admission Control and resource allocation procedure, it is important to investigate the characteristics of the model in which GCRA-enforced sources are merged together by a multiplexer. Such a multiplexer could be the one arranged in front of a switch to concentrate user traffic and reduce the number of required input ports. It may also represent the logical multiplexer at the output port of a switch that collects cells routed from various input ports. Moreover, it may represent the service function of the edge router situated between the integrated-services (IntServ) networks and the backbone networks that provide differentiated-services (DiffServ). In this paper, the environment under discussion is a multiplexer in which every traffic source is enforced by a dual-stage GCRA enforcer before being merged. The worst traffic pattern that maximizes the average waiting time in the multiplexer is found. The maximum average waiting time is deduced and expressed as a function of the GCRA parameters and the number of multiplexed sources. In particular, the analysis considers the speed-up function, which is widely used for ATM multiplexers and switches. The results can also be applied to a GCRA shaper without any modification.
ER -