Critical Thresholds for Dynamic Routing in Queueing Networks

  • Authors:
  • Yih-Choung Teh;Amy R. Ward

  • Affiliations:
  • Department of Statistics, University of Oxford, Oxford, UK yc@teh.org.uk;Department of Industrial and Systems Engineering, Georgia Institute of Technology, USA amy@isye.gatech.edu

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies dynamic routing in a parallel server queueing network with a single Poisson arrival process and two servers with exponential processing times of different rates. Each customer must be routed at the time of arrival to one of the two queues in the network. We establish that this system operating under a threshold policy can be well approximated by a one-dimensional reflected Brownian motion when the arrival rate to the network is close to the processing capacity of the two servers. As the heavy traffic limit is approached, thresholds which grow at a logarithmic rate are critical in determining the behavior of the limiting system. We provide necessary and sufficient conditions on the growth rate of the threshold for (i) approximation of the network by a reflected Brownian motion (ii) positive recurrence of the limiting Brownian diffusion and (iii) asymptotic optimality of the threshold policy.