Discrete time queues with phase dependent arrivals
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.<>Keywords
This publication has 5 references indexed in Scilit:
- A single-server queue with server vacations and a class of non-renewal arrival processesAdvances in Applied Probability, 1990
- Queue length distributions from probability generating functions via discrete fourier transformsOperations Research Letters, 1989
- Queueing behavior of statistical multiplexers with correlated inputsIEEE Transactions on Communications, 1988
- Buffering of Slow TerminalsBell System Technical Journal, 1978
- Delay Performance of a Buffered Communication NetworkIEEE Transactions on Communications, 1972