The infinite server queue and heuristic approximations to the multi-server queue with and without retrials (Q1969171)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The infinite server queue and heuristic approximations to the multi-server queue with and without retrials |
scientific article; zbMATH DE number 1415810
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The infinite server queue and heuristic approximations to the multi-server queue with and without retrials |
scientific article; zbMATH DE number 1415810 |
Statements
The infinite server queue and heuristic approximations to the multi-server queue with and without retrials (English)
0 references
22 June 2000
0 references
This paper discusses three topics: (1) monotonicity properties of the transition probabilities for the initially empty \(\text{M}_t/ \text{G}/ \infty\) queue, and qualitative similarities with the M/M/1 queue; (2) a comparison of such probabilities for \(\text{M/M/}m/m\) and \(\text{M/M/}\infty\) queues; and (3) decomposition formulae for operating characteristics of the \(\text{M/M/}m/m+d\) queue. There is only brief mention of retrial systems.
0 references
\(\text{M}_t/\text{G}/\infty\) queue
0 references
\(\text{M/M/}m/m+d\) queue
0 references
decomposition formula
0 references
