Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains

DOI10.1287/ijoc.1100.0387zbMath1243.90048OpenAlexW2003658481MaRDI QIDQ2899110

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

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

Related Items

EXPLICIT SOLUTIONS FOR CONTINUOUS-TIME QBD PROCESSES BY USING RELATIONS BETWEEN MATRIX GEOMETRIC ANALYSIS AND THE PROBABILITY GENERATING FUNCTIONS METHOD ⋮ ANALYSIS OF A CLEARING QUEUEING SYSTEM WITH SERVER MAINTENANCE AFTER N NEGATIVE FEEDBACKS ⋮ The snowball effect of customer slowdown in critical many-server systems ⋮ Fitting correlated arrival and service times and related queueing performance ⋮ 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 ⋮ DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS ⋮ Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward ⋮ To clean or not to clean: malware removal strategies for servers under load ⋮ A comparative analysis of the successive lumping and the lattice path counting algorithms ⋮ Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service Rates ⋮ A polling system with `join the shortest -- serve the longest' policy