The GI/PH/1 Queue: a Method to Find The Transition Matrix

DOI10.1080/03155986.1982.11731854zbMath0507.60087OpenAlexW2407639518MaRDI QIDQ4745111

Winfried K. Grassmann

Publication date: 1982

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1982.11731854

zbMATH Keywords

randomizationphase-type distributionembedded Markov chain technique

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (6)

Four Canadian Contributions to Stochastic Modeling ⋮ Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues ⋮ Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type ⋮ Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) ⋮ Analysis of \(GI^{X}/ M(n)// N\) systems with stochastic customer acceptance policy ⋮ Optimal service rates for the state-dependent \(M/G/1\) queues in steady state

This page was built for publication: The GI/PH/1 Queue: a Method to Find The Transition Matrix