Stochastic Systems · 2013 · 63 citations · 27 references
BusinessDecision SciencesQueuing TheoryService OperationsStochastic ProcessesQueue ManagementQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryQueuing AnalysisAbandonmentCustomer AbandonmentCustomer Abandonment ModelsDensityNumerical Queue Length ComputationQueue Length Process ApproximationQueueing ModelsStationary Queue Length Distribution
We use a multidimensional diffusion process to approximate the dynamics of a queue served by many parallel servers. Waiting customers in this queue may abandon the system without service. To analyze the diffusion model, we develop a numerical algorithm for computing its stationary distribution. A crucial part of the algorithm is choosing an appropriate reference density. Using a conjecture on the tail behavior of the limit queue length process, we propose a systematic approach to constructing a reference density. With the proposed reference density, the algorithm is shown to converge quickly in numerical experiments. These experiments demonstrate that the diffusion model is a satisfactory approximation for many-server queues, sometimes for queues with as few as twenty servers.
27
Markov Processes: Characterization and Convergence.
Andris Abakuks, S. N. Ethier, Thomas G. Kurtz · Biometrics · 1987 · 4.5K citations
Statistical Analysis of a Telephone Call Center
Lawrence Brown, Noah Gans, Avishai Mandelbaum et al. · Journal of the American Statistical Association · 2005 · 834 citations
Heavy-Traffic Limits for Queues with Many Exponential Servers
S. Halfin, Ward Whitt · Operations Research · 1981 · 771 citations