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 …

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 …

We consider a discrete-time Geo/G/1 retrial queue in which the retrial time has a general
distribution and the server, after each service completion, begins a process of search in …

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 …

This paper analyses a discrete-time Geo/G/1 retrial queue with batch arrivals in which
individual arriving customers have a control of admission. We study the underlying Markov …

We analyse a discrete-time Geo [X]/GH/1 retrial queue where each call after service either
immediately returns to the orbit for another service with probability θ or leaves the system …

This paper is concerned with a discrete-time Geo/G/1 retrial queue with preferred, impatient
customers and general retrial times. We analyze the Markov chain underlying the …

We consider a retrial queueing system where customers at the retrial group have preemptive
priority over customers at the waiting line. The stationary distribution can be approximated at …

It is well known that discrete-time queues are more appropriate than their continuous-time
counterparts for modelling computer and telecommunication systems. This paper is …

In this paper, we consider a queuing model in which two types of customers, say, Types 1
and 2, arrive according to a Markovian arrival process (MAP). Type 1 customers have a …