A survey on retrial queues
type: Item
instance of: scholarly article
title: A survey on retrial queues
zbMATH Open document ID: 0658.60124
DOI: 10.1007/BF01158899
author: Tao Yang
author: J. G. C. Templeton
published in: Queueing Systems
publication date: 1987-01-01T00:00:00Z
review text: A systematized survey of the analytic results for retrival queues is given by discussing a generalized model A/B/s/m/O/H. Here, A and B describe the interarrival and service time distribution, respectively, s denotes the number of waiting positions in the queue, O is the capacity of an orbit for the retrying customers and \(H=\{H_ k\), \(k\geq 0\}\) denotes the loss model by which a customer joins to the orbit with probability \(1-H_ k\) after the k th unsuccessful retrial. The survey concentrates an single-server models of type M/G/i/m/O/H. For \(m=1\), \(O=\infty\), \(H=NL=\{H_ k=1\), \(k\geq 0\}\), the number N of customers in the system, the waiting time w, the number \(\eta\) of retrials, the length L of busy periods, the number M of customers served in such periods, the server idle time i and the distribution \(\pi\) of time intervals between consecutive departures are examined. For M/M/1/m/O/H with finite m, O and \(H=GL=\{H_ k=\alpha \leq 1\), \(k\geq 0\}\) the exact values of state probabilities p(i,j), i,j\(\geq 0\), are derived, where i and j are the numbers of customers in the waiting room and in the orbit respectively. With \(O=\infty\) and \(H=NL\) an iterative procedure to approximate p(i,j) is reported. In the case of batch arrivals the M/G/1 models are discussed. For the multi-server retrial queues only some major models, techniques dealing with the problems arising, and some main results are presented. Different full-availability and non-full-availability systems are reported. It is shown that the decomposition property, which is a common feature of queues with server vacations, is also true in retrial queues of the model M/G/s/m.
reviewed by: J.Tanko
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4076266
zbMATH Keywords: imbedded Markov chain
zbMATH Keywords: stochastic decomposition
zbMATH Keywords: retrival queues
zbMATH Keywords: batch arrivals
zbMATH Keywords: multi-server retrial queues
zbMATH Keywords: server vacations
MaRDI profile type: Publication
cites work: Q5185813
cites work: New results in the theory of repeated orders queueing systems
cites work: Q3932569
cites work: Queueing systems with vacations - a survey
cites work: Aggregate arrival of customers in a one-line system with repeated calls
cites work: Q3892047
cites work: Q3962755
cites work: Switching systems with allowance for repeated calls
cites work: Q3936465
cites work: Q3657758
cites work: Q3698620
cites work: On sufficient conditions for ergodicity of multichannel queueing systems with repeated calls
cites work: Q3787263
cites work: On the waiting-time process in a single-line queue with repeated calls
cites work: Approximations to Stochastic Service Systems, with an Application to a Retrial Model
cites work: An upper bound on the performance of queues with returning customers
cites work: A Service System with Unfilled Requests Repeated
cites work: Q3727101
cites work: Q4101255
cites work: ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS
cites work: Loss Systems with Mixed Renewal and Poisson Inputs
cites work: On queueing systems by retrials
cites work: A game theoretic model for two types of customers competing for service
cites work: Expected waiting times in a multiclass batch arrival retrial queue
cites work: Q3292873
cites work: Integral equilibrium relations of non-full-access systems with repeated calls, and their applications
cites work: Q3935256
cites work: Q3314714
cites work: Properties of probability characteristics of a communications network with repeat calls
cites work: Algorithms of approximate design of systems with repeated calls
cites work: Q3706806
cites work: Q3689985
cites work: Explicit formulas for the characteristics of the M/M/2/2 queue with repeated attempts
cites work: Q4726025
description: scientific article; zbMATH DE number 4076266