Approximation in the \(M_{2}/G_{2}/1\) queue with preemptive priority

DOI10.1007/s11009-010-9175-xzbMath1235.60128OpenAlexW2044111164MaRDI QIDQ655931

Naima Hamadouche, Djamil Aissani

Publication date: 26 January 2012

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-010-9175-x

zbMATH Keywords

simulationperturbationMarkov chainstrong stabilitypreemptive queue

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25)

Related Items (1)

Impact of Nonparametric Density Estimation on the Approximation of the G∕G∕1 Queue by the M∕G∕1 One

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(MAP/G/1\) \(G\)-queues with preemptive resume and multiple vacations
• Estimates for the deviations of the transition characteristics of nonhomogeneous Markov processes
• The problem of stability in queueing theory
• Improved bounds for a condition number for Markov chains
• Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority
• Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline
• On a Question Concerning Condition Numbers for Markov Chains
• Priority Queues
• On the Continuity of Stochastic Sequences Generated by Recurrent Processes
• Taylor series expansions for stationary Markov chains
• Loss behavior in space priority queue with batch Markovian arrival process — discrete-time case
• Preemptive Resume Priority Queue
• SERIES EXPANSIONS FOR FINITE-STATE MARKOV CHAINS
• Sensitivity and convergence of uniformly ergodic Markov chains
• Comparison of perturbation bounds for the stationary distribution of a Markov chain

This page was built for publication: Approximation in the \(M_{2}/G_{2}/1\) queue with preemptive priority