Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic

We study a single-server queue, operating under the first-in-first-out (FIFO) service discipline, in which each customer independently abandons the queue if his service has not begun within a generally distributed amount of time. Under some mild conditions on the abandonment distribution, we identify a limiting heavy-traffic regime in which the resulting diffusion approximation for both the offered waiting time process (the process that tracks the amount of time an infinitely patient arriving customer would wait for service) and the queue-length process contain the entire abandonment distribution. To use a continuous mapping approach to establish our weak convergence results, we additionally develop existence, uniqueness, and continuity results for nonlinear generalized regulator mappings that are of independent interest. We further perform a simulation study to evaluate the quality of the proposed approximations for the steady-state mean queue length and the steady-state probability of abandonment suggested by the limiting diffusion process.

[1]  Ward Whitt,et al.  Heavy-Traffic Limits for Loss Proportions in Single-Server Queues , 2004, Queueing Syst. Theory Appl..

[2]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. I , 1970, Advances in Applied Probability.

[3]  S. Resnick A Probability Path , 1999 .

[4]  S. Shreve,et al.  An explicit formula for the Skorokhod map on [0,a]. , 2007, 0710.2977.

[5]  Avishai Mandelbaum,et al.  A model for rational abandonments from invisible queues , 2000, Queueing Syst. Theory Appl..

[6]  Avishai Mandelbaum,et al.  Adaptive Behavior of Impatient Customers in Tele-Queues: Theory and Empirical Support , 2002, Manag. Sci..

[7]  John P. Lehoczky,et al.  Multiple-input heavy-traffic real-time queues , 2003 .

[8]  Ward Whitt,et al.  Engineering Solution of a Basic Call-Center Model , 2005, Manag. Sci..

[9]  Amy R. Ward,et al.  A diffusion approximation for a generalized Jackson network with reneging , 2004 .

[10]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[11]  Zhang Hanqin,et al.  MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC , 1990 .

[12]  John Frank Charles Kingman,et al.  The single server queue in heavy traffic , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  Lukasz Kruk,et al.  Accuracy of state space collapse for earliest-deadline-first queues , 2006 .

[14]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[15]  Peter W. Glynn,et al.  Properties of the Reflected Ornstein–Uhlenbeck Process , 2003, Queueing Syst. Theory Appl..

[16]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[17]  P. Hall,et al.  Martingale Limit Theory and its Application. , 1984 .

[18]  Ioannis Karatzas,et al.  Brownian Motion and Stochastic Calculus , 1987 .

[19]  S. Shreve,et al.  Real-time queues in heavy traffic with earliest-deadline-first queue discipline , 2001 .

[20]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[21]  J. Dai,et al.  A heavy traffic limit theorem for a class of open queueing networks with finite buffers ∗ , 1999 .

[22]  John P. Lehoczky,et al.  Real-time queueing theory , 1996, 17th IEEE Real-Time Systems Symposium.

[23]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[24]  Sunil Kumar,et al.  Asymptotically Optimal Admission Control of a Queue with Impatient Customers , 2008, Math. Oper. Res..

[25]  J. Kingman Two Similar Queues in Parallel , 1961 .

[26]  G. Pile Étude des délais d'attente des aéronefs à l'atterrissage , 1955 .

[27]  J. Kingman On Queues in Heavy Traffic , 1962 .

[28]  S. Shreve,et al.  Earliest-deadline-first service in heavy-traffic acyclic networks , 2004, math/0407136.

[29]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[30]  M. Reiman The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks , 1982 .

[31]  P. Echeverría A criterion for invariant measures of markov processes , 1982 .

[32]  David D. Yao,et al.  Fundamentals of Queueing Networks , 2001 .

[33]  J. M. Harrison,et al.  Drift rate control of a Brownian processing system , 2005 .

[34]  A. Skorokhod Stochastic Equations for Diffusion Processes in a Bounded Region , 1961 .

[35]  Nicholas Bambos,et al.  ON STABILITY OF QUEUEING NETWORKS WITH JOB DEADLINES , 2003 .

[36]  Peter W. Glynn,et al.  A Diffusion Approximation for a Markovian Queue with Reneging , 2003, Queueing Syst. Theory Appl..

[37]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[38]  R. Lillo,et al.  STABILITY IN QUEUES WITH IMPATIENT CUSTOMERS , 2001 .

[39]  Avishai Mandelbaum,et al.  Statistical Analysis of a Telephone Call Center , 2005 .

[40]  Peter W. Glynn,et al.  A Diffusion Approximation for a GI/GI/1 Queue with Balking or Reneging , 2005, Queueing Syst. Theory Appl..

[41]  Avishai Mandelbaum,et al.  Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue , 2005, Queueing Syst. Theory Appl..