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

Abstract

The performance of an asynchronous transfer mode (ATM) network subject to admission control and traffic smoothing is analyzed. Basically, an ATM switch is modeled as a discrete-time single-server queuing system in which a new call joins existing calls. Cell arrivals from a new call are assumed to follow a general distribution. It is also assumed that aggregated arrivals of cells from existing calls form batch arrivals with a general batch size distribution and a geometric distribution of the interarrival times between batches. Both finite- and infinite-buffer cases are considered. An exact analysis yields the waiting time distribution and cell loss probability for a new call and for existing calls. Numerical examples are given to show how the network performance depends on the statistics of a new call (burstiness, time that a call stays in an active or inactive state, etc.) and to demonstrate the effectiveness of admission control and traffic smoothing.<>