Discrete time queues with phase dependent arrivals

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. >

[1]  Herwig Bruneel.  Queueing behavior of statistical multiplexers with correlated inputs , 1988, IEEE Trans. Commun..

[2]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[3]  W. W. Chu.  A study of asynchronous time division multiplexing for time-sharing computer systems , 1969, AFIPS '69 (Fall).

[4]  Janusz Filipiak.  Structured systems analysis methodology for design of an ATM network architecture , 1989, IEEE J. Sel. Areas Commun..

[5]  B. Gopinath,et al.  Buffering of slow terminals , 1978, The Bell System Technical Journal.

[6]  William H. Press,et al.  Numerical Recipes in FORTRAN - The Art of Scientific Computing, 2nd Edition , 1987 .

[7]  John N. Daigle,et al.  Queue length distributions from probability generating functions via discrete fourier transforms , 1989 .

[8]  W. Rickard.  Delay Performance of a Buffered Communication Network , 1972, IEEE Trans. Commun..

[9]  Herwig Bruneel.  Some remarks on discrete-time buffers with correlated arrivals , 1985, Comput. Oper. Res..

[10]  Y. Lee,et al.  Discrete time queues with phase dependent arrivals , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  O. Bunke.  Feller, F.: An Introduction to Probability Theory and its Applications, Vol. II, John Wiley & Sons, Inc., New York‐London‐Sydney, 1966. XVIII + 626 S., 3 Abb., 2 Tab., Preis $ 12,00 , 1969 .

[12]  Robert B. Cooper,et al.  An Introduction To Queueing Theory , 2016 .

[13]  M. Neuts,et al.  Numerical Methods for a Class of Markov Chains Arising in Queueing Theory. , 1978 .

[14]  Don Towsley,et al.  The Analysis of a Statistical Multiplexer with Nonindependent Arrivals and Errors , 1980, IEEE Trans. Commun..

[15]  M. Neuts,et al.  A single-server queue with server vacations and a class of non-renewal arrival processes , 1990, Advances in Applied Probability.