Explicit and Iterative Numerical Approaches to Solving Queueing Models (Q3685808)
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 3909497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit and Iterative Numerical Approaches to Solving Queueing Models |
scientific article; zbMATH DE number 3909497 |
Statements
Explicit and Iterative Numerical Approaches to Solving Queueing Models (English)
0 references
1985
0 references
phase-type distribution
0 references
balance equations
0 references
steady-state probability distribution
0 references
matrix-geometric steady-state probability distribution
0 references
0.7933246493339539
0 references
0.7861058115959167
0 references
0.7847630381584167
0 references
This paper considers two approaches to the numerical solution of single node queueing models. Both approaches use a phase-type distribution to model very general service processes. The first approach is explicit and sometimes can exploit the structure of certain balance equations to reduce the global balance equations from a set of second order difference equations to a set of first order difference equations. This reduction permits the steady-state probability distribution to be written explicitly as a function of the model parameters. The second approach, due to Neuts, uses the fact that most queues that have a matrix-geometric steady-state probability distribution can be solved by means of a recursive technique. We compare the approaches and present a theorem that specifies necessary conditions for the computation of an explicit solution. Some examples are provided.
0 references