On queues in discrete regenerative environments, with application to the second of two queues in series

Autor:	K. Balagopal
Rok vydání:	1979
Předmět:	Statistics and Probability Discrete mathematics Sequence Queueing theory Queue management system Series (mathematics) Service time Applied Mathematics 010102 general mathematics 01 natural sciences 010104 statistics & probability Limit (mathematics) 0101 mathematics Heavy traffic Queue Mathematics
Zdroj:	Advances in Applied Probability. 11:851-869
ISSN:	1475-6064 0001-8678
DOI:	10.2307/1426863
Popis:	Let Un be the time between the nth and (n + 1)th arrivals to a single-server queuing system, and Vn the nth arrival's service time. There are quite a few models in which {Un, Vn , n ≥ 1} is a regenerative sequence. In this paper, some light and heavy traffic limit theorems are proved solely under this assumption; some of the light traffic results, and all the heavy traffic results, are new for two such models treated earlier by the author; and all the results are new for the semi-Markov queuing model. In the last three sections, the results are applied to a single-server queue whose input is the output of a G/G/1 queue functioning in light traffic.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51aa246bd3fbfe5977240d5ef413cfdd https://doi.org/10.2307/1426863 Zobrazit plný text záznamu