Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality

One of the successes of the Brownian approximation approach to dynamic control of queueing networks is the design of a control policy for closed networks with two servers by Harrison and Wein. Adopting a Brownian approximation with only heuristic justification, they interpret the optimal control policy for the Brownian model as a static priority rule and conjecture that this priority rule is asymptotically optimal as the closed networks’s population becomes large. This paper studies closed queueing networks with two servers that are balanced, that is, networks that have the same relative load factor at each server. The validity of the Brownian approximation used by Harrison and Wein is established by showing that, under the policy they propose, the diffusion-scaled workload imbalance process converges weakly in the infinite population limit to the diffusion predicted by the Brownian approximation. This is accomplished by proving that the fluid limits of the queue length processes undergo state space collapse in finite time under the proposed policy, thereby enabling the application of a powerful new technique developed by Williams and Bramson that allows one to establish convergence of processes under diffusion scaling by studying the behavior of limits under fluid scaling. A natural notion of asymptotic optimality for closed queueing networks is defined in this paper. The proposed policy is shown to satisfy this definition of asymptotic optimality by showing that the performance under the proposed policy approximates bounds on the performance under every other policy arbitrarily well as the population increases without bound.

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

[2]  James J. Solberg,et al.  Capacity Planning with a Stochastic Workflow Model , 1981 .

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

[4]  J. Michael Harrison,et al.  Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[5]  Lawrence M. Wein,et al.  Scheduling networks of queues: Heavy traffic analysis of a simple open network , 1989, Queueing Syst. Theory Appl..

[6]  David L. Woodruff,et al.  CONWIP: a pull alternative to kanban , 1990 .

[7]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[8]  T. Lindvall Lectures on the Coupling Method , 1992 .

[9]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[10]  P. R. Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..

[11]  J. Dai On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[12]  Gideon Weiss,et al.  Stability and Instability of Fluid Models for Reentrant Lines , 1996, Math. Oper. Res..

[13]  Ruth J. Williams,et al.  Existence and Uniqueness of Semimartingale Reflecting Brownian Motions in Convex Polyhedrons , 1996 .

[14]  P. Glasserman,et al.  Stochastic networks : stability and rare events , 1997 .

[15]  Jan A. Van Mieghem,et al.  Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .

[16]  Ruth J. Williams,et al.  An invariance principle for semimartingale reflecting Brownian motions in an orthant , 1998, Queueing Syst. Theory Appl..

[17]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

[18]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[19]  Wanyang Dai,et al.  A heavy traffic limit theorem for a class of open queueing networks with finite buffers , 1999, Queueing Syst. Theory Appl..