ETAQA: an efficient technique for the analysis of QBD-processes by aggregation

DOI10.1016/S0166-5316(99)00030-9zbMATH Open1051.68515OpenAlexW2100954968MaRDI QIDQ4779404FDOQ4779404

Authors: Gianfranco Ciardo, Evgenia Smirni 

Publication date: 24 June 2003

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-5316(99)00030-9

Recommendations

• ETAQA solutions for infinite Markov processes with repetitive structure
• Quasi-birth-and-death processes, level-geometric distributions. An aggregation/disaggregation approach
• A novel computational method for solving finite qbd processes
• On the Solution to QBD Processes with Finite State Space
• Analysis of queueing networks with blocking using a new aggregation technique

zbMATH Keywords

Markov reward functions

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (8)

• Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes
• Hierarchical space merging algorithm for analysis of two stage queueing network with feedback
• ETAQA solutions for infinite Markov processes with repetitive structure
• Stability for fluid queues: characteristic inequalities
• The unobserved waiting customer approximation
• On the ergodicity of a class of level-dependent quasi-birth-and-death processes
• Hierarchical space merging algorithm for the analysis of open tandem queueing networks
• Approximate solution for two stage open networks with Markov-modulated queues minimizing the state space explosion problem

This page was built for publication: ETAQA: an efficient technique for the analysis of QBD-processes by aggregation

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