Combinatorial techniques for M/G/1-type queues

Autor:	G. Mercankosk, G. M. Nair, W. J. Soet
Rok vydání:	2001
Předmět:	Statistics and Probability General Mathematics Statistics Probability and Uncertainty
Zdroj:	Journal of Applied Probability. 38:722-736
ISSN:	1475-6072 0021-9002
DOI:	10.1017/s0021900200018878
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::88022bd3a7a31e1ee4e02d5a249cf929 https://doi.org/10.1017/s0021900200018878 Zobrazit plný text záznamu