Heavy-traffic asymptotics of a priority polling system with threshold service policy
From MaRDI portal
(Redirected from Publication:342103)
Abstract: In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system consisting of three M/M/1 queues with threshold policy. It turns out that the scaled queue-length of the critically loaded queue is exponentially distributed, independent of that of the stable queues. In addition, the queue lengths of stable queues possess the same distributions as a priority polling system with N-policy vacation. Based on this fact, we provide the exact tail asymptotics of the vacation polling system to approximate the tail distribution of the queue lengths of the stable queues, which shows that it has the same prefactors and decay rates as the classical M/M/1 preemptive priority queues. Finally, a stochastic simulation is taken to test the results aforementioned.
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; zbMATH DE number 4066094
- 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
Cites work
- scientific article; zbMATH DE number 4041013 (Why is no real title available?)
- scientific article; zbMATH DE number 836618 (Why is no real title available?)
- scientific article; zbMATH DE number 879786 (Why is no real title available?)
- Exact tail asymptotics for a discrete-time preemptive priority queue
- Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Interacting queues in heavy traffic
- 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
- 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
Cited in
(10)- An asymptotic property of branching-type overloaded polling networks
- The asymptotic behavior of a branching-type polling network in heavy traffic
- scientific article; zbMATH DE number 3920172 (Why is no real title available?)
- The impact of priority policy in a two-queue Markovian polling system with multi-class priorities
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- On the three-queue priority polling system with threshold service policy
- 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
- A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types
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)