Two Workload Properties for Brownian Networks

As one approach to dynamic scheduling problems for open stochastic processing networks, J.M. Harrison has proposed the use of formal heavy traffic approximations known as Brownian networks. A key step in this approach is a reduction in dimension of a Brownian network, due to Harrison and Van Mieghem [21], in which the “queue length” process is replaced by a “workload” process. In this paper, we establish two properties of these workload processes. Firstly, we derive a formula for the dimension of such processes. For a given Brownian network, this dimension is unique. However, there are infinitely many possible choices for the workload process. Harrison [16] has proposed a “canonical” choice, which reduces the possibilities to a finite number. Our second result provides sufficient conditions for this canonical choice to be valid and for it to yield a non-negative workload process. The assumptions and proofs for our results involve only first-order model parameters.

[1]  O. H. Brownlee,et al.  ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

[2]  Andrew B. Whinston,et al.  Optimization over Leontief substitution systems , 1975 .

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 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]  F. P. Kelly,et al.  Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling , 1993, Queueing Syst. Theory Appl..

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

[8]  Hong Chen,et al.  Control and scheduling in a two-station queueing network: Optimal policies and heuristics , 1994, Queueing Syst. Theory Appl..

[9]  S. Fotopoulos.  Stochastic modeling and analysis of manufacturing systems , 1996 .

[10]  L. F. Martins,et al.  Heavy Traffic Convergence of a Controlled, Multiclass Queueing System , 1996 .

[11]  L. F. Martins,et al.  Heavy Traffic Analysis of a Controlled Multiclass Queueing Network via Weak Convergence Methods , 1996 .

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

[13]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[14]  R. Hariharan,et al.  Scheduling in a multi-class series of queues with deterministic service times , 1996, Queueing Syst. Theory Appl..

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

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

[17]  J. Harrison.  Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies , 1998 .

[18]  James Williams.  On Dynamic Scheduling of a Parallel Server System With Complete Resource Pooling , 1999 .

[19]  J. Michael Harrison,et al.  Heavy traffic resource pooling in parallel‐server systems , 1999, Queueing Syst. Theory Appl..

[20]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

[21]  H. Kushner,et al.  Optimal control of assignment of jobs to processors under heavy traffic , 2000 .

[22]  C. Laws,et al.  Alternative routeing in fully connected queueing networks , 2000 .

[23]  Sunil Kumar.  Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality , 2000 .

[24]  Ruth J. Williams,et al.  On dynamic scheduling of stochastic networks in heavy traffic and some new results for the workload process , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[25]  J. Harrison.  Brownian models of open processing networks: canonical representation of workload , 2000 .

[26]  C. Maglaras.  Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality , 2000 .

[27]  Sean P. Meyn.  Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation , 2001, SIAM J. Control. Optim..

[28]  Mark S. Squillante,et al.  Threshold-based priority policies for parallel-server systems with affinity scheduling , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[29]  J. Michael Harrison,et al.  Stochastic Networks and Activity Analysis , 2002 .

[30]  Constantinos Maglaras,et al.  Continuous-Review Tracking Policies for Dynamic Control of Stochastic Networks , 2003, Queueing Syst. Theory Appl..

[31]  Sean P. Meyn.  Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations , 2003, SIAM J. Control. Optim..

[32]  J. Harrison.  A broader view of Brownian networks , 2003 .

[33]  Alexander L. Stolyar,et al.  Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..

[34]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[35]  S. Sushanth Kumar,et al.  Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies , 2005, math/0503477.