Abstract
The queueing behavior of many communication systems is well modeled by a queueing system in which time is slotted, and the number of entities that arrive during a slot is dependent upon the state of a discrete time, discrete state Markov chain. Techniques for analyzing such systems have appeared in the literature from time to time, but distributions have been presented in only rare instances In the paper, the authors present the probability generating function (PGF) for joint and marginal buffer occupancy distributions of statistical time division multiplexing systems in this class. They discuss inversion of the PGF using discrete Fourier transforms, and also discuss a simple technique for obtaining moments of the queue length distribution. 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">></ETX>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
