The \(M/G/1\) retrial queue with nonpersistent customers (Q1813544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(M/G/1\) retrial queue with nonpersistent customers |
scientific article; zbMATH DE number 6562 |
Statements
The \(M/G/1\) retrial queue with nonpersistent customers (English)
0 references
25 June 1992
0 references
An \(M/G/1\) queue is considered where arriving customers finding the server occupied will either leave the system with probability \(1-\alpha\) or arrive again with probability \(\alpha\) after an exponentially distributed time. An integro-differential system of equations is derived for the generating functions of the steady-state probabilities. Moreover, a recursion scheme is given for the related factorial moments based on the (unavailable) steady-state probability \(\rho\) that the server is busy. For \(\rho\) again a numerical algorithm is proposed.
0 references
generating functions
0 references
steady-state probabilities
0 references
numerical algorithm
0 references
0.8788460493087769
0 references
0.8500745892524719
0 references
0.8429586291313171
0 references
0.8393468260765076
0 references
0.8383435606956482
0 references
