IEEE Transactions on Communications · 1994 · 30 citations · 19 references
BusinessComputer EngineeringComputer ScienceProbability TheoryQueuing TheoryStochastic ProcessesMarkov ChainsQueue Length DistributionsQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryBuffer Occupancy DistributionDiscrete Fourier TransformDiscrete-time Fourier TransformDiscrete-time ModelsDiscrete-time Queueing ModelsQueue Length Generating FunctionsQueue Length MomentsQueue Length Probability Distribution
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>
19
Numerical Recipes--The Art of Scientific Computing.
Frederick N. Fritsch, William H. Press, Brian P. Flannery et al. · Mathematics of Computation · 1988 · 4.9K citations
Numerical Recipes in C-The Art of Scientific Computing.
W. G., William H. Press, Brian P. Flannery et al. · Mathematics of Computation · 1989 · 1.5K citations
Introduction to Probability Models
RL, Sheldon M. Ross · Journal of the American Statistical Association · 1998 · 1.5K citations