Long-run behavior of an ATM multiplexer with homogeneous discrete-time ON-OFF sources

We propose a new approach to the exact analysis of a shared buffer ATM multiplexer, which is loaded with homogeneous discrete-time ON-OFF sources. Renewal cycles are identified in regard to the state of input sources and the buffer state on each cycle is modelled as a K (shared buffer site)-state Markov chain. We analyze the long-run behavior of the shared buffer during the renewal cycle, and derive the limiting probability of input source and buffer states, which leads to the exact analysis of the multiplexer. The queue length distribution of the shared buffer and the cell loss rate are also derived. Our approach to the exact analysis of the multiplexer seems to be more efficient than most of the other existing ones since our underlying Markov chain has fewer number of states.