An M/G/1 retrial queue with recurrent customers and general retrial times (Q706732): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.amc.2003.09.019 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.AMC.2003.09.019 / rank | |||
Normal rank |
Revision as of 07:33, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An M/G/1 retrial queue with recurrent customers and general retrial times |
scientific article |
Statements
An M/G/1 retrial queue with recurrent customers and general retrial times (English)
0 references
9 February 2005
0 references
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.
0 references
retrial queue
0 references
retrial time
0 references
ergodicity
0 references
steady-state distribution
0 references
stochastic decomposition law
0 references