Polling systems with zero switchover times: A heavy-traffic averaging principle
From MaRDI portal
Publication:1909398
DOI10.1214/aoap/1177004701zbMath0842.60088OpenAlexW2069926892WikidataQ56906958 ScholiaQ56906958MaRDI QIDQ1909398
Martin I. Reiman, Edward G. jun. Coffman, Anatolii A. Puhalskii
Publication date: 22 July 1996
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177004701
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Functional limit theorems; invariance principles (60F17)
Related Items (34)
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: past, present, and perspective ⋮ ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS ⋮ Polling systems with periodic server routing in heavy traffic: renewal arrivals ⋮ A two-queue polling model with priority on one queue and heavy-tailed on/off sources: a heavy-traffic limit ⋮ Waiting times in queueing networks with a single shared server ⋮ HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS ⋮ Stability analysis of parallel server systems under longest queue first ⋮ 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 ⋮ POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE ⋮ 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 ⋮ Mathematical methods to study the polling systems ⋮ Heavy traffic analysis of a polling model with retrials and glue periods ⋮ Towards a unifying theory on branching-type polling systems in heavy traffic ⋮ Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms ⋮ POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS ⋮ DELAYS AT SIGNALIZED INTERSECTIONS WITH EXHAUSTIVE TRAFFIC CONTROL ⋮ Finite-buffer polling systems with threshold-based switching policy ⋮ Random Fluid Limit of an Overloaded Polling Model ⋮ Polling models with multi-phase gated service ⋮ The impact of scheduling policies on the waiting-time distributions in polling systems ⋮ Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies ⋮ A note on polling models with renewal arrivals and nonzero switch-over times ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ Infinite server queues in a random fast oscillatory environment ⋮ Heavy traffic analysis of roving server networks ⋮ An ODE for an Overloaded X Model Involving a Stochastic Averaging Principle ⋮ Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times ⋮ An asymptotic property of branching-type overloaded polling networks
This page was built for publication: Polling systems with zero switchover times: A heavy-traffic averaging principle
