Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies

Obtains a variety of linear programs to conduct the performance analysis and stability/instability determination of queueing networks and scheduling policies. The authors exhibit a strong duality relationship between the performance of a system, and its stability analysis via mean drift. A Performance LP bounds the performance of all stationary non-idling scheduling policies. If it is bounded, then its dual, called the Drift LP, has a feasible solution, which is a copositive matrix. The quadratic form associated with this copositive matrix has a negative drift, allowing the authors to conclude that all stationary non-idling scheduling policies are stable in the very strong sense of having a geometrically converging exponential moment. Some systems satisfy an auxiliary set of linear constraints. Their performance is also bounded by a Performance LP, provided that they are stable, i.e., have a finite first moment for the number of parts. If the Performance LP is infeasible, then the system is unstable. Any feasible solution to the dual of the Performance LP provides a quadratic function with a negative drift. If this quadratic form is copositive, then the system is strongly stable as above. If not, the system is either unstable, or else is highly non-robust in that arbitrarily small perturbations can lead to an unstable system. These results carry over to fluid models, allowing the study of networks with non-exponential distributions. Another LP test of stability avoids a copositivity check. If a Monotone LP is bounded, then the system is stable for all smaller arrival rates. Finally, a Finite Time LP provides transient bounds on the performance of the system.<<ETX>>

[1]  J. Doob.  Stochastic processes , 1953 .

[2]  David Blackwell,et al.  Positive dynamic programming , 1967 .

[3]  Richard W. Cottle,et al.  On classes of copositive matrices , 1970 .

[4]  Patrick Billingsley,et al.  Weak convergence of measures - applications in probability , 1971, CBMS-NSF regional conference series in applied mathematics.

[5]  Steven A. Lippman,et al.  Applying a New Device in the Optimization of Exponential Queuing Systems , 1975, Oper. Res..

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

[7]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .

[8]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

[9]  Harold J. Kushner,et al.  Approximation and Weak Convergence Methods for Random Processes , 1984 .

[10]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[11]  Guy Fayolle,et al.  On random walks arising in queueing systems: ergodicity and transience via quadratic forms as lyapounov functions — Part I , 1989, Queueing Syst. Theory Appl..

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

[13]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[14]  P. R. Kumar,et al.  Re-entrant lines , 1993, Queueing Syst. Theory Appl..

[15]  Guy Fayolle,et al.  Lyapounov Functions for Jackson Networks , 1993, Math. Oper. Res..

[16]  Stanley B. Gershwin,et al.  Manufacturing Systems Engineering , 1993 .

[17]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[18]  Yang Wang,et al.  Nonexistence of Brownian models for certain multiclass queueing networks , 1993, Queueing Syst. Theory Appl..

[19]  S. Sushanth Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[20]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[21]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[22]  V. Malyshev.  NETWORKS AND DYNAMICAL SYSTEMS , 1993 .

[23]  P. R. Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..

[24]  D. Botvich,et al.  Ergodicity of conservative communication networks , 1994 .

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

[26]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1995, IEEE Trans. Autom. Control..