Many-server heavy-traffic limit for queues with time-varying parameters

45Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

A many-server heavy-traffic FCLT is proved for the Gt/M/ st + GI queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment according to a general probability distribution. The fclt provides theoretical support for the approximating deterministic fluid model the authors analyzed in a previous paper and a refined Gaussian process approximation, using variance formulas given here. The model is assumed to alternate between underloaded and overloaded intervals, with critical loading only at the isolated switching points. The proof is based on a recursive analysis of the system over these successive intervals, drawing heavily on previous results for infinite-server models. The FCLT requires careful treatment of the initial conditions for each interval. © Institute of Mathematical Statistics, 2014.

Cite

CITATION STYLE

APA

Liu, Y., & Whitt, W. (2014). Many-server heavy-traffic limit for queues with time-varying parameters. Annals of Applied Probability, 24(1), 378–421. https://doi.org/10.1214/13-AAP927

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free