This paper studies discrete time Geo/G/1 retrial queues with Bernoulli schedule in which the blocked customers either join the inยฎnite waiting space with probability a or leave the server and enter the retrial orbit with probability a 1 ร a). The customers in the retrial orbit will retry their servi
Discrete-time Geo1, Geo2/G/1 retrial queueing systems with two types of calls
โ Scribed by B.D. Choi; J.W. Kim
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 470 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
We consider a discrete-time Geol, Geo2/G/1 retrial queue with two types of calls.
When arriving calls are blocked due to the server being busy, Type I calls are queued in the priority queue with infinite capacity whereas, Type II calls enter the retrial group in order to try service again after a random amount of time. We find the joint generating function of the number of calls in the priority queue and the number of calls in the retrial group in a closed form. It is shown that our results are consistent with those already known for special cases.
๐ SIMILAR VOLUMES
We consider a discrete-time Geo/G/1 retrial queue with starting failures in which all the arriving customers require a first essential service while only some of them ask for a second optional service. We study the Markov chain underlying the considered queueing system and its ergodicity condition.