Triangular M/G/1-type and tree-like quasi-birth-death Markov chains

DOI10.1287/IJOC.1100.0387MaRDI QIDQ2899110zbMATH OpenOpenAlexFDO

Authors Benny Van Houdt, Johan S. H. van Leeuwaarden

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1100.0387

zbMATH Keywords

matrix-analytic methods quasi-birth-death processes triangular \(M/G/1\)-type Markov chains tree-like QBD nonlinear matrix equation

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Continuous-time Markov processes on discrete state spaces (60J27)

Recommendations

• Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains
• Solving m/g/l type markov chains: recent advances and applications
• Tree Structured QBD Markov Chains and Tree‐Like QBD Processes
• A family of fast fixed point iterations for M/G/1-type Markov chains
• scientific article; zbMATH DE number 967328

Cited in

(14)

• Explicit solutions for continuous-time QBD processes by using relations between matrix geometric analysis and the probability generating functions method
• Fitting correlated arrival and service times and related queueing performance
• A comparative analysis of the successive lumping and the lattice path counting algorithms
• DES and RES processes and their explicit solutions
• Modeling load and overwork effects in queueing systems with adaptive service rates
• The snowball effect of customer slowdown in critical many-server systems
• A polling system with `join the shortest -- serve the longest' policy
• Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
• A non-inverse general matrix analytical solution method
• ANALYSIS OF A CLEARING QUEUEING SYSTEM WITH SERVER MAINTENANCE AFTER N NEGATIVE FEEDBACKS
• On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue
• To clean or not to clean: malware removal strategies for servers under load
• QBD Markov chains on binomial-like trees and its application to multilevel feedback queues
• Tree Structured QBD Markov Chains and Tree‐Like QBD Processes

This page was built for publication: Triangular \(M/G/1\)-type and tree-like quasi-birth-death Markov chains

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