Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality

This paper describes a general approach for dynamic control of stochastic networks based on fluid model analysis, where in broad terms, the stochastic network is approximated by its fluid analog, an associated fluid control problem is solved and, finally, a scheduling rule for the original system is defined by interpreting the fluid control policy. The main contribution of this paper is to propose a general mechanism for translating the solution of the fluid optimal control problem into an implementable discrete-reviewpolicy that achieves asymptotically optimal performance under fluid scaling, and guarantees stability if the traffic intensity is less than one at each station. The proposed policy reviews system status at discrete points in time, and at each such point the controller formulates a processing plan for the next reviewperiod, based on the queue length vector observed, using the optimal control policy of the associated fluid optimization problem. Implementation of such a policy involves enforcement of certain safety stock requirements in order to facilitate the execution of the processing plans and to avoid unplanned server idleness. Finally, putting aside all considerations of system optimality, the following generalization is considered: every initial condition is associated with a feasible fluid trajectory that describes the desired system evolution starting at that point. A discrete-reviewpolicy is described that asymptotically tracks this target specification; that is, it achieves the appropriate target trajectory as its fluid limit.

[1]  Arthur E. Bryson,et al.  Applied Optimal Control , 1969 .

[2]  G. F. Newell,et al.  Applications of Queueing Theory. , 1983 .

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

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

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

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

[7]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[8]  Hong Chen,et al.  Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations , 1991, Math. Oper. Res..

[9]  P. R. Kumar,et al.  Distributed scheduling based on due dates and buffer priorities , 1991 .

[10]  F. P. Kelly,et al.  Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling , 1993, Queueing Syst. Theory Appl..

[11]  Mark H. A. Davis Piecewise-deterministic Markov processes , 1993 .

[12]  M. Pullan An algorithm for a class of continuous linear programs , 1993 .

[13]  Hong Chen,et al.  Dynamic Scheduling of a Multiclass Fluid Network , 1993, Oper. Res..

[14]  J. Walrand,et al.  Scheduling and stability aspects of a general class of parallel processing systems , 1993, Advances in Applied Probability.

[15]  J. Tsitsiklis,et al.  Branching bandits and Klimov's problem: achievable region and side constraints , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[16]  Hong Chen,et al.  Performance evaluation of scheduling control of queueing networks: Fluid model heuristics , 1995, Queueing Syst. Theory Appl..

[17]  J. Tsitsiklis,et al.  Branching bandits and Klimov's problem: achievable region and side constraints , 1995, IEEE Trans. Autom. Control..

[18]  Leandros Tassiulas,et al.  Optimal anticipative scheduling with asynchronous transmission opportunities , 1995 .

[19]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

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

[21]  Jim Dai Stability of open multiclass queueing networks via fluid models , 1995 .

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

[23]  Leandros Tassiulas,et al.  timal Anticipative Scheduling wit synchronous Transmission Opport , 1995 .

[24]  M. Pullan Forms of Optimal Solutions for Separated Continuous Linear Programs , 1995 .

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

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

[27]  Sean P. Meyn,et al.  Fluid Network Models: Linear Programs for Control and Performance Bounds , 1996 .

[28]  M. Pullan A Duality Theory for Separated Continuous Linear Programs , 1996 .

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

[30]  Sean P. Meyn The Policy Improvement Algorithm for Markov Decision Processes , 1997 .

[31]  Sean P. Meyn The policy iteration algorithm for average reward Markov decision processes with general state space , 1997, IEEE Trans. Autom. Control..

[32]  Garrett van Ryzin,et al.  Optimal Control of a Multiclass, Flexible Queueing System , 1997, Oper. Res..

[33]  Anatolii A. Puhalskii,et al.  A critically loaded multirate link with trunk reservation , 1998, Queueing Syst. Theory Appl..

[34]  Maury Bramson,et al.  Stability of two families of queueing networks and a discussion of fluid limits , 1998, Queueing Syst. Theory Appl..

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

[36]  Sean P. Meyn,et al.  Value iteration and optimization of multiclass queueing networks , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[37]  D. Bertsimas,et al.  A New Algorithm for State-Constrained Separated Continuous Linear Programs , 1999 .

[38]  Constantinos Maglaras,et al.  Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies , 1999, Queueing Syst. Theory Appl..

[39]  Gideon Weiss,et al.  An algorithm for minimum wait drainingof two‐station fluid re‐entrant line , 1999, Ann. Oper. Res..

[40]  A. Stolyar On the Stability of Multiclass Queueing Networks: A Relaxed SuÆcient Condition via Limiting Fluid Processes , .