For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Bound on Waiting Time for Multiplexing Traffic Enforced/Shaped by GCRA in ATM Networks
IEICE TRANSACTIONS on Communications
Publication Date: 2004/07/01
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Fundamental Theories
ATM, multiplexer, GCRA, enforcer, shaper, waiting time,
Full Text: PDF(530.3KB)>>
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.