Error bounds on practical approximation for two tandem queue with blocking and non-preemptive priority

DOI10.1016/J.CAMWA.2011.02.009zbMath1219.90044OpenAlexW2046143333MaRDI QIDQ636567

Ouiza Lekadir, Djamil Aissani

Publication date: 28 August 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.02.009

zbMATH Keywords

simulationapproximationMarkov chaintandem queuestrong stabilitynon-preemptive priority

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• Performance analysis approximation in a queueing system of type \(M/G/1\)
• Kernel density in the study of the strong stability of the \(M/M/1\) queueing system
• Investigation of the \(M_2/G_2/1/\infty ,N\) queue with restricted admission of priority customers and its application to HSDPA mobile systems
• Estimate of the strong stability in an (\(R,s,S\)) inventory model
• Priority queues
• Series Expansions for Continuous-Time Markov Processes
• An Approximation Approach for the Deviation Matrix of Continuous-Time Markov Processes with Application to Markov Decision Theory
• Strong Stability of Queues with Multiple Vacation of the Server
• Stability of Two-Stage Queues with Blocking
• A Priority Tandem Queue with No Intermediate Buffer
• Taylor series expansions for stationary Markov chains
• AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS(<Special Issue>Network Design, Control and Optimization)
• Priority Assignment in Waiting Line Problems
• SERIES EXPANSIONS FOR FINITE-STATE MARKOV CHAINS
• Stability Estimates for Finite Homogeneous Continuous-time Markov Chains
• A Sequence of Two Servers with No Intermediate Queue
• Perturbation theory and finite Markov chains

This page was built for publication: Error bounds on practical approximation for two tandem queue with blocking and non-preemptive priority