JR Artalejo, A Gómez-Corral - Mathematical and Computer Modelling, 1999 - Springer
We consider a branch of queueing theory, retrial queueing systems, which is characterized by the following basic assumption: a customer who cannot receive service (due to finite …
J Kim, B Kim - Annals of operations research, 2016 - Springer
Retrial queueing systems have been extensively studied because of their applications in telephone systems, call centers, telecommunication networks, computer systems, and in …
We study an M/G/1 queue with second optional service. Poisson arrivals with mean arrival rate λ (> 0) all demand the first 'essential'service, whereas only some of them demand the …
Retrial queues have been widely used to model many problems arising in telephone switching systems, telecommunication networks, computer networks and computer systems …
In this paper we consider a single server retrial queue where the server is subject to breakdowns and repairs. New customers arrive at the service station according to a Poisson …
We consider a retrial queueing model with collision arising from the specific communication protocol CSMAICD. Under the retrial control policy in which the retrial rate is inversely …
BD Choi, Y Chang - Mathematical and Computer modelling, 1999 - Elsevier
We present a survey of retrial queues with two types of calls and present new results of several models. We consider the M1, M2/G/1 retrial queue and its variations which are the …
GI Falin, JR Artalejo, M Martin - Queueing systems, 1993 - Springer
We consider an M 2/G 2/1 type queueing system which serves two types of calls. In the case of blocking the first type customers can be queued whereas the second type customers must …
We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server …