QBD Markov chains on binomial-like trees and its application to multilevel feedback queues

DOI10.1007/s10479-007-0288-8zbMath1144.90353OpenAlexW2021240192MaRDI QIDQ928194

J. Van Velthoven, Benny Van Houdt, Chris Blondia

Publication date: 11 June 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10067/712670151162165141

zbMATH Keywords

matrix-analytic methodsmultilevel feedback queuesQBD Markov chainstree-like processes

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Queues and service in operations research (90B22)

Related Items

Profit optimisation of the multiple-vacation machine repair problem using particle swarm optimisation

Uses Software

• EMpht
• SMCSolver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An EM algorithm for estimation in Markov-modulated Poisson processes
• An EM algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure
• Solving nonlinear matrix equations arising in tree-like stochastic processes.
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• The quasi-birth-death type markov chain with a tree structure
• Matrix product-form solutions for Markov chains with a tree structure
• Tree Structured QBD Markov Chains and Tree‐Like QBD Processes
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• Numerical Methods for Structured Markov Chains
• Feedback Queueing Models for Time-Shared Systems
• Swap-Time Considerations in Time-Shared Systems