Combinatorial techniques for M/G/1-type queues
G. Mercankosk, G. M. Nair, and W. J. Soet
Source: J. Appl. Probab. Volume 38, Number 3
(2001), 722-736.
Abstract
The application of the generalised ballot theorem to queueing theory leads to elegant results for the simple M/G/1 queue. It is thought that such results are not possible for more general M/G/1-type queues. We, however, derive a batch ballot theorem which can be applied to derive the first passage distribution matrix, G, for the general M/G/1-type queue.
First Page:
Show
Hide
Keywords: M/G/1-type Markov queues; nonlinear matrix equations; ballot theorems; combinatorial techniques
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jap/1005091035
Digital Object Identifier: doi:10.1239/jap/1005091035
Mathematical Reviews number (MathSciNet): MR1860209
Zentralblatt MATH identifier: 0991.60090
Journal of Applied Probability
