Explicit Solution of a Quorum Queueing System (Q4804876)
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 1903070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit Solution of a Quorum Queueing System |
scientific article; zbMATH DE number 1903070 |
Statements
Explicit Solution of a Quorum Queueing System (English)
0 references
28 April 2003
0 references
\(r\)-quorum queueing model
0 references
characteristic equation
0 references
batch service
0 references
embedded Markov chain
0 references
0 references
0 references
0.8259865045547485
0 references
0.7882357835769653
0 references
0.7868606448173523
0 references
0.7868188619613647
0 references
0.7808049321174622
0 references
An \(M/G/1\)-type queueing system is considered where server takes a batch of \(r\) customers to serve with a distribution \(B\) (and waits if queue size is less). An explicit solution for steady-state queue-size probabilities both for the discrete time case (when the queue at the completion service times is considered) and for the continuous time case is found in terms of zeros inside and/or outside the closed unit ball, of the characteristic equation. This equation includes the Laplace-Stieltjes transform of the service time distribution \(B\). Mean queue size in both cases is found.
0 references
