We consider the ¿(i)/GI/1 queue, in which the arrival times of a fixed population of n customers are sampled independently from an identical distribution. This model recently emerged as the canonical model for so-called transitory queues that are non-stationary, time-varying and might operate only over finite time. The model assumes a finite population of customers entering the queue only once. This paper presents a method for analyzing heavy-traffic behavior by using uniform acceleration, which simultaneously lets the population n and the service rate grow large, while the initial resource utilization approaches one. A key feature of the model is that, as time progresses, more customers have joined the queue, and fewer customers can potent...
AbstractTo help provide a theoretical basis for approximating queues with superposition arrival proc...
textabstractWe consider a $GI/G/1$ queue in which the service time distribution and/or the interarri...
We study the heavy traffic regime of a discrete-time queue driven by correlated inputs, namely the M...
We consider a single-server queue that serves a finite population of n customers that will enter the...
We consider the ¿(i)/GI/1 queue, in which the arrival times of a fixed population of n customers are...
This paper addresses the analysis of the queue-length process of single-server queues under overdisp...
Heavy traffic limit theorems are established for a class of single server queueing models including ...
AbstractStochastic variables associated to a single-server queueing system with finite population ar...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus-tomer aban...
AbstractWe analyze a sequence of single-server queueing systems with impatient customers in heavy tr...
We consider the Δ(i)/G/1 queue, in which a total of n customers join a single-server queue for servi...
To help provide a theoretical basis for approximating queues with superposition arrival processes, w...
For the ${GI/G/1$ queueing model with heavy-tailed service- and arrival time distributions and traff...
We consider the heavy-traffic approximation to the GI/M/s queueing system in the Halfin–Whitt regime...
AbstractTo help provide a theoretical basis for approximating queues with superposition arrival proc...
textabstractWe consider a $GI/G/1$ queue in which the service time distribution and/or the interarri...
We study the heavy traffic regime of a discrete-time queue driven by correlated inputs, namely the M...
We consider a single-server queue that serves a finite population of n customers that will enter the...
We consider the ¿(i)/GI/1 queue, in which the arrival times of a fixed population of n customers are...
This paper addresses the analysis of the queue-length process of single-server queues under overdisp...
Heavy traffic limit theorems are established for a class of single server queueing models including ...
AbstractStochastic variables associated to a single-server queueing system with finite population ar...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus-tomer aban...
AbstractWe analyze a sequence of single-server queueing systems with impatient customers in heavy tr...
We consider the Δ(i)/G/1 queue, in which a total of n customers join a single-server queue for servi...
To help provide a theoretical basis for approximating queues with superposition arrival processes, w...
For the ${GI/G/1$ queueing model with heavy-tailed service- and arrival time distributions and traff...
We consider the heavy-traffic approximation to the GI/M/s queueing system in the Halfin–Whitt regime...
AbstractTo help provide a theoretical basis for approximating queues with superposition arrival proc...
textabstractWe consider a $GI/G/1$ queue in which the service time distribution and/or the interarri...
We study the heavy traffic regime of a discrete-time queue driven by correlated inputs, namely the M...