Dynamic Server Allocation for Queueing Networks with Flexible Servers

This paper is concerned with the design of dynamic server assignment policies that maximize the capacity of queueing networks with flexible servers. Flexibility here means that each server may be capable of performing service at several different classes in the network. We assume that the interarrival times and the service times are independent and identically distributed, and that routing is probabilistic. We also allow for server switching times, which we assume to be independent and identically distributed. We deduce the value of a tight upper bound on the achievable capacity by equating the capacity of the queueing network model with that of a limiting deterministic fluid model. The maximal capacity of the deterministic model is given by the solution to a linear programming problem that also provides optimal allocations of servers to classes. We construct particular server assignment policies, called generalized round-robin policies, that guarantee that the capacity of the queueing network will be arbitrarily close to the computed upper bound. The performance of such policies is studied using numerical examples.

[1]  C. Laws.  Resource pooling in queueing networks with dynamic routing , 1992, Advances in Applied Probability.

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

[3]  Sean P. Meyn,et al.  Stability and convergence of moments for multiclass queueing networks via fluid limit models , 1995, IEEE Trans. Autom. Control..

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

[5]  K. Sigman.  The stability of open queueing networks , 1990 .

[6]  Willard Miller,et al.  The IMA volumes in mathematics and its applications , 1986 .

[7]  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 .

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

[9]  Jr. C. Humes,et al.  A regulator stabilization technique: Kumar-Seidman revisited , 1994, IEEE Trans. Autom. Control..

[10]  Mor Armony,et al.  Queueing networks with interacting service resources , 1999 .

[11]  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).

[12]  P. R. Kumar,et al.  Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems , 1990 .

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

[14]  Otis B. Jennings,et al.  Multiclass queueing networks with setup delays :stability analysis and heavy traffic approximation , 2000 .

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

[16]  Sigrún Andradóttir,et al.  Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems , 2001, Manag. Sci..

[17]  Florin Avram,et al.  Fluid models of sequencing problems in open queueing networks; an optimal control approach , 1995 .

[18]  Maury Bramson,et al.  Convergence to equilibria for fluid models of FIFO queueing networks , 1996, Queueing Syst. Theory Appl..

[19]  Frederick S. Hillier,et al.  On the Simultaneous Optimization of Server and Work Allocations in Production Line Systems with Variable Processing Times , 1996, Oper. Res..

[20]  Sean P. Meyn,et al.  Stability of Generalized Jackson Networks , 1994 .

[21]  Maury Bramson,et al.  Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks , 1996, Queueing Syst. Theory Appl..

[22]  M. Bramson.  Instability of FIFO Queueing Networks , 1994 .

[23]  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).

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

[25]  Hong Chen.  Fluid Approximations and Stability of Multiclass Queueing Networks: Work-Conserving Disciplines , 1995 .