An M/G/1 retrial queue with recurrent customers and general retrial times
type: Item
instance of: scholarly article
title: An M/G/1 retrial queue with recurrent customers and general retrial times
zbMATH Open document ID: 1063.60139
author: D. Kharzeev
published in: Applied Mathematics and Computation
publication date: 2005-02-09T00:00:00Z
review text: Retrial queueing systems have been found many applications in the fields of telephone switching systems and telecommunication networks, and recently becomes a hot topic in stochastic model area. The author considers an M/G/1 type retrial queue with two types of customers, namely, transit and recurrent customers. The transit customers arrive at the system according to a Poisson process, and the recurrent customers immediately return to the retrial group after having received a service. There is a fixed number of the recurrent customers in the system. Successive interretrial times of any recurrent customer follow an exponential distribution. The service times for the transit and recurrent customers are independent and identically distributed. Using the Foster criterion, the ergodicity of the system is established. By the technique of generating functions, the steady-state distributions of the queue length processes are given. A stochastic decomposition law for this retrial queueing system is given, too.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 2132549
zbMATH Keywords: retrial queue
zbMATH Keywords: retrial time
zbMATH Keywords: ergodicity
zbMATH Keywords: steady-state distribution
zbMATH Keywords: stochastic decomposition law
reviewed by: Hanqin Zhang
MaRDI profile type: Publication
full work available at URL: j.amc.2003.09.019
OpenAlex ID: W2046056683
cites work: An \(\text{M}^X/\text{G}/1\) retrial queue with exhaustive vacations
cites work: Analysis of an \(M/G/1\) queue with constant repeated attempts and server vacations
cites work: A classified bibliography of research on retrial queues: Progress in 1990--1999
cites work: Stochastic decomposition for retrial queues
cites work: An \(M/M/1\) retrial queue with control policy and general retrial times
cites work: Q3946848
cites work: A survey of retrial queues
cites work: Retrial Queues
cites work: Single line queue with repeated demands
cites work: Single line queue with recurrent repeated demands
cites work: Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
cites work: Stochastic analysis of a single server retrial queue with general retrial times
cites work: The \(M/G/1\) retrial queue with Bernoulli schedules and general retrial times
cites work: Q3626431
cites work: The M/G/1 retrial queue with feedback and starting failures
cites work: An \(M/G/1\) retrial queueing system with two-phase service and preemptive resume
cites work: Analysis of an M/G/1 queue with two types of impatient units
cites work: A service model in which the server is required to search for customers
cites work: Technical Note—Mean Drifts and the Non-Ergodicity of Markov Chains
cites work: An approximation method for the \(M/G/1\) retrial queue with general retrial times
cites work: A survey on retrial queues
DOI: 10.1016/J.AMC.2003.09.019
description: scientific article; zbMATH DE number 2132549