Analysis of a discrete-time single-server queue with bursty inputs for traffic control in ATM networks

To evaluate the performance of an ATM (asynchronous transfer mode) network when it is subject to admission control or traffic smoothing, the authors develop a discrete-time single-server queuing model where a new call joins the existing calls. In this model, it is assumed that the cell arrivals from a new call follow a general distribution. It is also assumed that the aggregated arrivals of cells from the existing calls form batch arrivals with a general distribution for the batch size and geometric distribution for the interarrival times of batches. The authors consider an infinite buffer case and analytically obtain the waiting-time distribution for a new call and for existing calls. The analysis is an exact one. Through numerical examples, the authors investigate how the network performance depends on the statistics of a new call (burstiness, time that a call stays in active or inactive state, etc). They also demonstrate the effectiveness of traffic smoothing in reducing network congestion