Heavy-traffic asymptotics of a priority polling system with threshold service policy
DOI10.1016/J.COR.2015.06.013zbMATH Open1349.90225arXiv1408.4192OpenAlexW1591144521MaRDI QIDQ342103FDOQ342103
Yuqing Chu, Jinbiao Wu, Zaiming 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
Recommendations
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- The asymptotic behavior of a branching-type polling network in heavy traffic
- Limit theorems for priority queues with patch processing in heavy traffic. I
- A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit
- Heavy-traffic limits for many-server queues with service interruptions
- scientific article
- On the three-queue priority polling system with threshold service policy
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Singularity Analysis of Generating Functions
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- Polling systems and multitype branching processes
- 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
- Priority queueing model with changeover times and switching threshold
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model
Cited In (9)
- An asymptotic property of branching-type overloaded polling networks
- The asymptotic behavior of a branching-type polling network in heavy traffic
- A polling-based dynamic order-picking system considering priority orders
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Title not available (Why is that?)
- On the three-queue priority polling system with threshold service policy
- A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types
- Stability of a two-queue cyclic polling system with BMAPs under gated service and state-dependent time-limited service disciplines
- Analysis of a batch arrival retrial queue with impatient customers subject to the server disasters
This page was built for publication: Heavy-traffic asymptotics of a priority polling system with threshold service policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342103)