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

DOI10.1080/03155986.1982.11731854MaRDI QIDQ4745111zbMATH OpenOpenAlexFDO

Authors 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

embedded Markov chain techniquephase-type distributionrandomization

Mathematics Subject Classification ID

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

Cited in

(6)

• 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
• Four Canadian Contributions to Stochastic Modeling
• Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745111)