Based on the careful analysis of several hundred publications, this book uniformly describes
basic methods of analysis and critical results of the theory of retrial queues. Chapters …

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 …

Retrial queueing systems are widely used in teletraffic theory and computer and
communication networks. Although there has been a rapid growth in the literature on retrial …

We consider multiserver retrial queues in which the time between two successive repeated
attempts is independent of the number of customers applying for service. We study a …

This study analyzes the system reliability of the retrial machine repair system with M
operating units, S warm standby units and a single repair server with N-policy. Failure times …

We consider an M/G/1 retrial queue with general retrial times where the blocked customers
either with probability q join the infinite waiting room (called priority queue) or with …

This paper deals with the steady state behavior of an M/G/1 queue with general retrial time
and Bernoulli vacation schedule for an unreliable server, which consist of a breakdown …

Two independent Poisson streams of jobs flow into a single-server service system having a
limited common buffer that can hold at most one job. If a type-i i job (i= 1, 2 i= 1, 2) finds the …

In this work, we consider a novel single-server retrial queue with event-dependent arrival
rates. Contrary to other related works, the primary customers' arrival rates depend on the last …

A single server retrial queueing system with two-classes of orbiting customers, and general
class dependent service times is considered. If an arriving customer finds the server …