论文信息 - Explicit Steady-State Solutions to Some Elementary Queueing Models

Explicit Steady-State Solutions to Some Elementary Queueing Models

Several simple queueing models, commonly used as textbook examples, have explicit steady-state solutions, which to date have escaped notice. These solutions are easily computable. In addition to their didactic interest, the results presented here are also useful in the analysis of more complex queueing models.

Marcel F. Neuts

[1] M. Neuts. Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector , 1978, Advances in Applied Probability.

[2] Leonard Kleinrock,et al. Theory, Volume 1, Queueing Systems , 1975 .

[3] Marcel F. Neuts,et al. Algorithmic Solution of Some Queues with Overflows , 1982 .

[4] Marcel F. Neuts,et al. Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .