Performance evaluation of a CAC strategy for broadband networks

Abstract

A broadband network (e.g. ATM or B-ISDN) node with m-channels of equal capacity and two types of customer arrivals under the complete sharing (CS) call admission control (CAC) strategy is analyzed. The two customer arrival types are; narrowband (n-type) which requires 1 channel (basic bandwidth unit, BBU) and wideband, (w-type) which requires b/sub w/ /spl ges/ 1 channels of the m available BBUs. W-type customers are queued in an infinite buffer while n-type customers are served in a "blocked calls cleared" fashion. Neuts' (1994) matrix analytic approach is used in analyzing the system. Neuts presents the solution to the system equations for the case of w-type customers requiring only 1 channel. In this work, this approach is generalized to include the case of w-type customers requiring b/sub w/ > 1 channels. Numerical examples for the blocking probability, the mean waiting time in the queue and the mean server utilization are presented. The analytic results are validated through system simulation. It is shown that both results are in good agreement. Evaluation and computation techniques applicable to the problem are also discussed.