Semi-explicit solutions for M/PH/1-like queueing systems (Q789113)
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: Semi-explicit solutions for M/PH/1-like queueing systems |
scientific article; zbMATH DE number 3844798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-explicit solutions for M/PH/1-like queueing systems |
scientific article; zbMATH DE number 3844798 |
Statements
Semi-explicit solutions for M/PH/1-like queueing systems (English)
0 references
1983
0 references
A continuous time parameter Markov process with an infinitesimal matrix of a special form is investigated. Such a Markov process describes as basic process queue length for a large class of queueing systems like those with Poisson input and a phase type of service. By means of a matrix-geometric approach the authors obtain important characteristics (such as: conditions for existence of the steady-state of the basic process and its stationary distribution) for a number of modifications and special cases of the mentioned queueing systems.
0 references
Poisson input
0 references
phase service
0 references
queue length
0 references
matrix-geometric approach
0 references
0 references
0 references
