On the three-queue priority polling system with threshold service policy
From MaRDI portal
Publication:513516
DOI10.1007/s12190-015-0976-5zbMath1359.60111OpenAlexW2224491711MaRDI QIDQ513516
Yuqing Chu, Zai-Ming Liu, Jin-biao Wu
Publication date: 7 March 2017
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-015-0976-5
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
- Interacting queues in heavy traffic
- Dynamic server assignment in a two-queue model
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- On the application of Rouché's theorem in queueing theory
- Priority queueing model with changeover times and switching threshold
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- An Interpolation Approximation for Queueing Systems with Poisson Input
- The power-series algorithm applied to cyclic polling systems
- Analyticity of Poisson-driven stochastic systems
- Multiclass Queueing Systems in Heavy Traffic: An Asymptotic Approach Based on Distributional and Conservation Laws
- PERFORMANCE ANALYSIS OF A TWO-QUEUE MODEL WITH AN (M,N)-THRESHOLD SERVICE SCHEDULE
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
This page was built for publication: On the three-queue priority polling system with threshold service policy