A Diffusion Approximation for a Markovian Queue with Reneging

  • Authors:
  • Amy R. Ward;Peter W. Glynn

  • Affiliations:
  • School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA amy@isye.gatech.edu;Department of Management Science & Engineering, Stanford University, Stanford, CA 94305, USA glynn@stanford.edu

  • Venue:
  • Queueing Systems: Theory and Applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected Ornstein–Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate and the reneging rate is close to 0. We further compare the quality of the steady-state distribution approximations suggested by each diffusion.