Heavy-traffic asymptotics of a priority polling system with threshold service policy
From MaRDI portal
Publication:342103
DOI10.1016/J.COR.2015.06.013zbMath1349.90225arXiv1408.4192OpenAlexW1591144521MaRDI QIDQ342103
Yuqing Chu, Jin-biao Wu, Zai-Ming Liu
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.4192
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)
Related Items (4)
Stability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplines ⋮ A polling-based dynamic order-picking system considering priority orders ⋮ Analysis of a batch arrival retrial queue with impatient customers subject to the server disasters ⋮ An asymptotic property of branching-type overloaded polling networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model
- Interacting queues in heavy traffic
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- Exact tail asymptotics for a discrete-time preemptive priority queue
- Polling systems and multitype branching processes
- Priority queueing model with changeover times and switching threshold
- Singularity Analysis of Generating Functions
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- 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: Heavy-traffic asymptotics of a priority polling system with threshold service policy
