arXiv Analytics

Sign in

arXiv:1208.5552 [math.PR]AbstractReferencesReviewsResources

A Unified Approach to Diffusion Analysis of Queues with General Patience-time Distributions

Junfei Huang, Hanqin Zhang, Jiheng Zhang

Published 2012-08-28, updated 2014-08-25Version 2

We propose a unified approach to establishing diffusion approximations for queues with impatient customers within a general framework of scaling customer patience time. The approach consists of two steps. The first step is to show that the diffusion-scaled abandonment process is asymptotically close to a function of the diffusion-scaled queue length process under appropriate conditions. The second step is to construct a continuous mapping not only to characterize the system dynamics using the system primitives, but also to help verify the conditions needed in the first step. The diffusion approximations can then be obtained by applying the continuous mapping theorem. The approach has two advantages: (i) it provides a unified procedure to establish the diffusion approximations regardless of the structure of the queueing model or the type of patience time scaling; (ii) and it makes the diffusion analysis of queues with customer abandonment essentially the same as the diffusion analysis of queues without customer abandonment. We demonstrate the application of the approach via the $G/GI/1+GI$ system with Markov-modulated service speeds in the traditional heavy-traffic regime and the $G/GI/n+GI$ system in the Halfin-Whitt regime.

Related articles: Most relevant | Search more
arXiv:math/0602430 [math.PR] (Published 2006-02-20)
Accuracy of Diffusion Approximations for High Frequency Markov Data
arXiv:2001.02249 [math.PR] (Published 2020-01-07)
Diffusion Approximations in the Online Increasing Subsequence Problem
arXiv:2108.12890 [math.PR] (Published 2021-08-29)
Diffusion Approximations for $\text{Cox}/G_t/\infty$ Queues In A Fast Oscillatory Random Environment