Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network

We consider a multiclass closed queueing network with two single-server stations. Each class requires service at a particular station, and customers change class after service according to specified probabilities. There is a general service time distribution for each class. The problem is to schedule the two servers to maximize the long-run average throughput of the network. By assuming a large customer population and nearly balanced loading of the two stations, the scheduling problem can be approximated by a dynamic control problem involving Brownian motion. A reformulation of this control problem is solved exactly and the solution is interpreted in terms of the queueing network to obtain a scheduling rule. We conjecture, quite naturally, that the resulting scheduling rule is asymptotically optimal under heavy traffic conditions, but no attempt is made to prove that. The scheduling rule is a static priority policy that computes an index for each class and awards higher priority at station 1 respectively, station 2 to classes with the smaller respectively, larger values of this index. An analytical comparison of this rule to any other static policy is also obtained. An example is given that illustrates the procedure and demonstrates its effectiveness.

[1]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[2]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[3]  W. Whitt.  Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.

[4]  J. Harrison.  A limit theorem for priority queues in heavy traffic , 1973, Journal of Applied Probability.

[5]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[6]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[7]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[8]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[9]  I. Karatzas.  A class of singular stochastic control problems , 1983, Advances in Applied Probability.

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

[11]  Michael I. Taksar,et al.  Average Optimal Singular Control and a Related Stopping Problem , 1985, Math. Oper. Res..

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

[13]  J. Harrison,et al.  The Stationary Distribution of Reflected Brownian Motion in a Planar Region , 1985 .

[14]  Ruth J. Williams,et al.  Conformal mapping solution of Laplace's equation on a polygon with oblique derivative boundary conditions , 1986 .

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

[16]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

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

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

[19]  Lawrence M. Wein,et al.  Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..

[20]  Hong Chen,et al.  Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .

[21]  L. F. Martins,et al.  Numerical Methods for Stochastic Singular Control Problems , 1991 .

[22]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs , 2011, Oper. Res..