Solving \(C_k/C_m/1/N\) queues by using characteristic roots in matrix analytic methods (Q2477348): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Q1180565 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jevsey Morozov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Steady-state probabilities of the PH/PH/1 queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix product-form solutions of stationary probabilities in tandem queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Approach to a General Class of G/G/s Queueing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The waiting-time distribution and its moments of the PH/PH/1 queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5737099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943598 / rank
 
Normal rank

Latest revision as of 19:24, 27 June 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
    0 references
    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
    0 references
    phase-type distribution
    0 references
    matrix analytic method
    0 references
    Laplace transform
    0 references
    vector product-form
    0 references
    0 references