Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods (Q2477348): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.apm.2006.02.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2041462437 / rank | |||
Normal rank |
Revision as of 18:26, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods |
scientific article |
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