Performance analysis of a shared-medium ATM switch

In this paper, we present an approximate analysis of a generic shared-medium ATM switch with input and output queueing. Input traffic is assumed to be bursty and is modelled by an interrupted Bernoulli process (IBP). Three different bus service policies are analyzed: time division multiplexing (TDM), cyclic, and random. The output links may have constant or geometric service time. The analysis is based on the notion of decomposition whereby the switch is decomposed into smaller sub-systems. First, each input queue is analyzed in isolation after we modify its service process. Subsequently, the shared medium is analyzed as a separate sub-system utilizing the output process of each input queue. Finally, each output queue is analyzed in isolation. The results from the individual sub-systems are combined together through an iterative scheme. This method permits realistic system characteristics such as limited buffer size, asymmetric load conditions, and nonuniform destinations to be taken into consideration in the analysis. The model's accuracy is verified through simulation.