An \(\text{M/M/}c\) queue with impatient customers (Q1969158)
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: An \(\text{M/M/}c\) queue with impatient customers |
scientific article; zbMATH DE number 1415801
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\text{M/M/}c\) queue with impatient customers |
scientific article; zbMATH DE number 1415801 |
Statements
An \(\text{M/M/}c\) queue with impatient customers (English)
0 references
22 January 2001
0 references
For an \(\text{M/M}/c+D\) system (many server system with constant maximal waiting time \(\tau\)) the loss probability can be expressed in terms of waiting time probabilities (value of the waiting time distribution at \(\tau\)) of the related standard \(\text{M/M}/c\) queue. For this known result a probabilistic derivation is given. Further open questions (and consequences) are discussed for the \(\text{M/M}/c\) retrial queues with impatience.
0 references
M/M/\(c\) queue
0 references
impatient customers
0 references
M/M/\(c+D\)
0 references
loss probability
0 references
