Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type

DOI10.1007/BF01158521zbMath0743.60098OpenAlexW2024089428MaRDI QIDQ1183690

Edward P. C. Kao

Publication date: 28 June 1992

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158521

zbMATH Keywords

717Markov chainsnumerical examplesqueuesstate reduction

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
• Equilibrium distribution of block-structured Markov chains with repeating rows
• Opsearch
• Modeling a Multiprocessor System with Preemptive Priorities
• An experimental evaluation of the matrix-geometric method for theGI/PH/1 queue
• The Factorization of Queueing Equations and Their Interpretation
• Regenerative Analysis and Steady State Distributions for Markov Chains
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• The M/M/1 Queue with Randomly Varying Arrival and Service Rates: A Phase Substitution Solution
• Computing the r matrices in matrix-geometric solutions for a class of qbd queues: a phase substitution approach
• Using State Reduction for Computing Steady State Probabilities of Queues of GI/PH/1 Types
• Numerical Solution of Linear Equations Arising in Markov Chain Models
• Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue
• The GI/PH/1 Queue: a Method to Find The Transition Matrix
• Approximating the stationary distribution of an infinite stochastic matrix

This page was built for publication: Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type