Conservation Laws for Single-Server Fluid Networks

We consider single-server fluid networks with feedback and arbitrary input processes. The server has to be scheduled in order to minimize a linear holding cost. This model is the fluid analogue of the so-called Klimov problem. Using the achievable-region approach, we show that the Gittins index rule is optimal in a strong sense: it minimizes the linear holding cost for arbitrary input processes and for all time points t≥0.

[1]  M. Dacre,et al.  The achievable region approach to the optimal control of stochastic systems , 1999 .

[2]  T. Kamae,et al.  Stochastic Inequalities on Partially Ordered Spaces , 1977 .

[3]  Shaler Stidham,et al.  Sample-path conservation laws, with applications to scheduling queues and fluid systems , 2000, Queueing Syst. Theory Appl..

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

[5]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[6]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

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

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

[9]  Nicole Bäuerle,et al.  Optimal control of single-server fluid networks , 2000, Queueing Syst. Theory Appl..

[10]  Dimitris Bertsimas,et al.  Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems , 2011, IPCO.

[11]  David D. Yao,et al.  Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..

[12]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[13]  Qing Zhang,et al.  Hierarchical Decision Making in Stochastic Manufacturing Systems , 1994 .

[14]  Edward G. Coffman,et al.  A Characterization of Waiting Time Performance Realizable by Single-Server Queues , 1980, Oper. Res..