Etude d'une file GI/G/1 à service autonome (avec vacances du serveur)
- 1 March 1986
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 18 (1) , 283-286
- https://doi.org/10.2307/1427249
Abstract
The purpose of this letter is to study a modified GI/G/1 queueing system in which the server becomes unavailable for (independent) random periods each time he is free. This problem was first studied by Gelenbe and Iasnogorodski [6] who obtained the stationary law of the waiting time of a customer. We construct a simple probabilistic model coupling a G//G/1 queue with an autonomous server (in Borovkov's terminology [1]) with a GI/G/1 queue of classical type having the same characteristics, to compare them stochastically. We prove that the waiting time is a Markov chain, using a renewal process property which has not previously been noted.Keywords
This publication has 3 references indexed in Scilit:
- A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up timesJournal of Applied Probability, 1985
- Stochastic Processes in Queueing TheoryPublished by Springer Nature ,1976
- On Regenerative Processes in Queueing TheoryPublished by Springer Nature ,1976