A survey of retrial queueing systems

Kim, Jeongsim; Kim, Bara

doi:10.1007/s10479-015-2038-7

Cited by 114 publications

(37 citation statements)

References 74 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This work is peripherally related to the considerable literature on retrial queues (we refer the reader to a recent survey paper [6] and the book [1]). Retrial queues are systems where blocked customers 'try again later'.…”

Section: Introductionmentioning

confidence: 99%

“Please Come Back Later”: Benefiting from Deferrals in Service Systems

Kagrecha

Nair

2020

2020 International Conference on COMmunication Systems &Amp; NETworkS (COMSNETS)

View full text Add to dashboard Cite

The performance evaluation of loss service systems, where customers who cannot be served upon arrival get dropped, has a long history going back to the classical Erlang B model. In this paper, we consider the performance benefits arising from the possibility of deferring customers who cannot be served upon arrival. Specifically, we consider an Erlang B type loss system where the system operator can, subject to certain constraints, ask a customer arriving when all servers are busy, to come back at a specified time in the future. If the system is still fully loaded when the deferred customer returns, she gets dropped for good. For such a system, we ask: How should the system operator determine the 'rearrival' times of the deferred customers based on the state of the system (which includes those customers already deferred and yet to arrive)? How does one quantify the performance benefit of such a deferral policy?Our contributions are as follows. We propose a simple statedependent policy for determining the rearrival times of deferred customers. For this policy, we characterize the long run fraction of customers dropped. We also analyse a relaxation where the deferral times are bounded in expectation. Via extensive numerical evaluations, we demonstrate the superiority of the proposed state-dependent policies over naive state-independent deferral policies.

show abstract

Section: Introductionmentioning

confidence: 99%

“Please Come Back Later”: Benefiting from Deferrals in Service Systems

Kagrecha

Nair

2020

2020 International Conference on COMmunication Systems &Amp; NETworkS (COMSNETS)

View full text Add to dashboard Cite

show abstract

“…The so called repeated customers are temporarily stored in a pool of unsatisfied customers (called orbit or retrial group), and are superimposed on the normal stream of external arrivals. For a complete review of the main results, the interested reader is referred to the seminal books [21,5], and in the detailed review papers [4,36,26].…”

Section: Introductionmentioning

confidence: 99%

A two-class queueing system with constant retrial policy and general class dependent service times

Dimitriou

2018

European Journal of Operational Research

View full text Add to dashboard Cite

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 unavailable, it enters a virtual queue, called the orbit, according to its type. The customers from the orbits retry independently to access the server according to the constant retrial policy. We derive the generating function of the stationary distribution of the number of orbiting customers at service completion epochs in terms of the solution of a Riemann boundary value problem. For the symmetrical system we also derived explicit expressions for the expected delay in an orbit without solving a boundary value problem. A simple numerical example is obtained to illustrate the system's performance.

show abstract

“…This can be achieved with the use of finite-source, or quasi-random input models. Retrial queues with quasi-random input are recent interest in modeling cellular mobile networks, computer networks and local-area networks with random access protocols, and with multiple-access protocols, see, for example, [3,8].…”

Section: Introductionmentioning

confidence: 99%

Simulation of Finite-Source Retrial Queueing Systems with Collisions and Non-reliable Server

Tóth

Bérczes

Sztrik

et al. 2017

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. The aim of the present paper is to build a simulation program to investigate finite-source retrial queuing system with collision of the customers where the server is subject to random breakdowns and repairs depending on whether it is idle or busy. All the random variables involved in the model construction are assumed to be independent and generally distributed. The novelty of the investigation is to carry sensitivity analysis of the performance measures using various distributions. Several figures show the effect of different distributions on the performance measures such as mean and variance of number of customers in the system, mean and variance of response time, mean and variance of time a customer spent in service, mean and variance of sojourn time in the orbit.

show abstract

A survey of retrial queueing systems

Cited by 114 publications

References 74 publications

“Please Come Back Later”: Benefiting from Deferrals in Service Systems

“Please Come Back Later”: Benefiting from Deferrals in Service Systems

A two-class queueing system with constant retrial policy and general class dependent service times

Simulation of Finite-Source Retrial Queueing Systems with Collisions and Non-reliable Server

Contact Info

Product

Resources

About