Polling systems with zero switchover times: A heavy-traffic averaging principle
From MaRDI portal
Recommendations
- Polling systems in heavy traffic: a Bessel process limit
- Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes
- scientific article; zbMATH DE number 2134069
- Relating polling models with zero and nonzero switchover times
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
Cited in
(42)- A note on polling models with renewal arrivals and nonzero switch-over times
- Fast-service polling systems with intensive input flows and constant switch times
- Polling: past, present, and perspective
- Polling models with multi-phase gated service
- Multiple-input heavy-traffic real-time queues.
- Heavy traffic limits for some queueing networks
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Polling systems with periodic server routing in heavy traffic: renewal arrivals
- Relating polling models with zero and nonzero switchover times
- Stability analysis of parallel server systems under longest queue first
- The impact of scheduling policies on the waiting-time distributions in polling systems
- Infinite server queues in a random fast oscillatory environment
- Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times
- An asymptotic property of branching-type overloaded polling networks
- Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
- A polling system with `join the shortest -- serve the longest' policy
- Mathematical methods to study the polling systems
- Towards a unifying theory on branching-type polling systems in heavy traffic
- POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
- Polling systems in heavy traffic: a Bessel process limit
- Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
- A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit
- scientific article; zbMATH DE number 2134069 (Why is no real title available?)
- Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes
- ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS
- POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE
- Waiting times in queueing networks with a single shared server
- Delay in polling systems with large switch-over times
- Polling systems with periodic server routeing in heavy traffic: distribution of the delay
- Heavy traffic analysis of a polling model with retrials and glue periods
- Diffusion approximation for an overloaded \(X\) model via a stochastic averaging principle
- Lingering issues in distributed scheduling
- On two-queue Markovian polling systems with exhaustive service
- Delays at signalized intersections with exhaustive traffic control
- Heavy traffic analysis of roving server networks
- Order now, pickup in 30 minutes: managing queues with static delivery guarantees
- A fluid-diffusion-hybrid limiting approximation for priority systems with fast and slow customers
- An ODE for an overloaded X model involving a stochastic averaging principle
- Finite-buffer polling systems with threshold-based switching policy
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge
- Random fluid limit of an overloaded polling model
This page was built for publication: Polling systems with zero switchover times: A heavy-traffic averaging principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909398)
