Discrete time queues with phase dependent arrivals

Abstract

The queuing behavior of many communication systems is well modeled by a queuing system in which time is slotted and in which the number of entities arriving during a slot is dependent upon the state of a discrete-time, discrete-state Markov chain. The probability generating function is presented for joint and marginal buffer occupancy distributions of statistical time-division multiplexing systems in this class. A simple technique is discussed for obtaining moments of the queue length distribution. In addition, a discussion is presented of inversion of the probability generating function. Numerical results, including queue length distributions for some special cases, are presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>