Quantitative Estimates in an M2/G2/1 Priority Queue with Non-Preemptive Priority: The Method of Strong Stability

DOI10.1080/15326340802427521zbMath1153.60392OpenAlexW1967674616MaRDI QIDQ3548752

Louiza Bouallouche-Medjkoune, Djamil Aissani

Publication date: 17 December 2008

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326340802427521

zbMATH Keywords

simulationapproximationstrong stabilityinequality of stabilitynon-preemptive priority \(M_2/G_2/1\) system

Mathematics Subject Classification ID

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

Related Items (2)

Perturbation analysis of the \(\mathrm{GI}/\mathrm{M}/s\) queue ⋮ Statistical techniques for a numerical evaluation of the proximity of \(G/G/1\) and \(G/M/1\) queueing systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Markov renewal approach to \(M/G/1\) type queues with countably many background states
• Markov chains and stochastic stability
• Performance analysis approximation in a queueing system of type \(M/G/1\)
• The problem of stability in queueing theory
• Improved bounds for a condition number for Markov chains
• Regular Markov chains for which the transition matrix has large exponent
• Priority queues
• On a Question Concerning Condition Numbers for Markov Chains
• Sensitivity of hidden Markov models
• Taylor series expansions for stationary Markov chains
• The spectral gap and perturbation bounds for reversible continuous-time Markov chains
• Stability and exponential convergence of continuous-time Markov chains
• On the occasion of the 60th birthday of Raytcho Lazarov
• Measure-Valued Differentiation for Stationary Markov Chains
• SERIES EXPANSIONS FOR FINITE-STATE MARKOV CHAINS
• Sensitivity and convergence of uniformly ergodic Markov chains
• Quantitative Stability in Stochastic Programming: The Method of Probability Metrics
• Error Bounds for Perturbing Nonexponential Queues
• Comparison of perturbation bounds for the stationary distribution of a Markov chain

This page was built for publication: Quantitative Estimates in an M₂/G₂/1 Priority Queue with Non-Preemptive Priority: The Method of Strong Stability