Scholion.ai

Time-Varying Robust Queueing

Ward Whitt, Wei You

Operations Research · 2019 · Volume 67 · Issue 6

DOI: 10.1287/opre.2019.1846

Abstract

We develop a time-varying robust-queueing (TVRQ) algorithm for the continuous-time workload in a single-server queue with a time-varying arrival-rate function. We apply this TVRQ to develop approximations for the periodic steady-state expected workload in models with a periodic arrival-rate function. We apply simulation and asymptotic methods to examine the performance of periodic TVRQ (PRQ). We find that PRQ predicts the mean of the periodic distribution and even the full distribution (specified by the quantiles) remarkably well. We show that the PRQ converges to a proper limit in appropriate long-cycle and heavy-traffic regimes and coincides with long-cycle fluid limits and heavy-traffic diffusion limits for long cycles.

Keywords

queues: nonstationary, approximations, limit theorems, Stochastic Models, robust queueing theory, time-varying arrival rates, nonstationary queues, periodic queues, heavy traffic

Enable JavaScript for citation tools and additional paper interactions.