Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods (Q2477348)
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: Solving C_k/C_m/1/N queues by using characteristic roots in matrix analytic methods |
scientific article; zbMATH DE number 5249162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods |
scientific article; zbMATH DE number 5249162 |
Statements
Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods (English)
0 references
13 March 2008
0 references
A \(C_k/C_m/1/N\) queueing system with Coxian input and service time distributions (with \(k\) and \(m\) phases, respectively) is considered using matrix analytic approach. It is shown that unboundary state probabilities can be expresses as a linear combination of vector product-forms. The approach includes analysis of steady-state balance equations, using Laplace -Stieltjes transforms, Rouche's theorem and matrix analysis. An algorithm is presented which is based on the last square approach and used to calculate stationary probabilities and corresponding performance measure. A numerical example is also presented.
0 references
phase-type distribution
0 references
matrix analytic method
0 references
Laplace transform
0 references
vector product-form
0 references
0.8592137694358826
0 references
0.7990195155143738
0 references
0.7947525382041931
0 references