Using State Reduction for Computing Steady State Probabilities of Queues of GI/PH/1 Types
ORSA Journal on Computing · 1991 · Volume 3 · Issue 3
Abstract
This paper presents two state reduction based algorithms for computing steady state probabilities of the embedded Markov chains of GI/PH/1 types of queues. The first algorithm generalizes the phase-substitution approach proposed by E.P.C. Kao and C. Lin for QBD (quasi-birth-and-death process) types of queues. The second one uses the general ideas proposed by Grassmann and Heyman in their new state reduction procedure. We show both algorithms are quite efficient for solving GI/PH/1 types of queues. We give two numerical examples at the end. INFORMS Journal on Computing , ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Keywords
queues: algorithms, Markovian
Enable JavaScript for citation tools and additional paper interactions.