Stability of Queueing Networks and Scheduling Policies

IEEE Transactions on Automatic Control

Volumn 40, Issue 2, 1995, Pages 251-260

  Kumar, P R ^a   Meyn, Sean P ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; INVARIANCE; LINEAR PROGRAMMING; LYAPUNOV METHODS; MARKOV PROCESSES; NONLINEAR PROGRAMMING; PROBABILITY; SCHEDULING; SYSTEM STABILITY;

EXPONENTIAL MOMENT; FIRST BUFFER FIRST SERVE; FIRST COME FIRST SERVED POLICY; INVARIANT DISTRIBUTION; LAST BUFFER FIRST SERVE; NONIDLING POLICIES; POSITIVE RECURRENCE; QUADRATIC FUNCTIONAL;

COMPUTER NETWORKS;

EID: 0029250558     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.341782     Document Type: Article

References (30)

1. S. H. Lu and P. R. Kumar, “Distributed scheduling based on due dates and buffer priorities,” IEEE Trans. Automat. Contr., vol. 36, pp. 1406-1416, Dec. 1991.
2. P. R. Kumar and T. I. Seidman, “Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems,” IEEE Trans. Automat. Contr., vol. 35, pp. 289-298, Mar. 1990.
3. C. J. Chase and P. J. Ramadge, “On the real time control of flexible manufacturing systems,” in Proc. IEEE 28th Conf. Decis. Contr., Tampa, FL, 1989, pp. 2026-2027.
4. A. N. Rybko and A. L. Stolyar, “On the ergodicity of stochastic processes describing open queueing networks,” Problemy Peredachi Informatsii, vol. 28, pp. 2-26, 1991.
5. T. I. Seidman, “' ‘First come first serve' is unstable!,” Univ. Maryland Baltimore County, Tech. Rep, 1993.
6. M. Bramson, “Instability of FIFO queueing networks,” Mathematics Dept., Univ. Wisconsin, Madison, Tech. Rep., 1993.
7. J. M. Harrison, “Brownian models of heterogeneous customer populations,” in Stochastic Differential Systems, Stochastic Control Theory and Applications( IMA Volumes in Mathematics and its Applications), W. Fleming and P. L. Lions, Eds. New York: Springer-Verlag, 1988, pp. 147-186.
8. J. M. Harrison and L. M. Wein, “Scheduling networks of queues: Heavy traffic analysis of a two-station closed network,” Op. Res., vol. 38, no. 6, pp. 1052-1064, 1990.
9. M. I. Reiman, “Open queueing networks in heavy traffic,” Math. Op. Res., vol. 9, pp. 441-458, 1984.
10. M. I. Reiman, “A multiclass queue in heavy traffic,” Advances in Applied Probability, vol. 20, pp. 179-207, 1988.
11. W. P. Peterson, “A heavy traffic limit theorem for networks of queues with multiple customer types,” Math. Op. Res., vol. 16, pp. 90-118, 1991.
12. J. G. Dai and Y. Wang, “Nonexistence of Brownian models of certain multiclass queueing networks,” Queueing Systems: Theory and Applications: Special Issue on Queueing Networks, vol. 13, pp. 41-46, May 1993.
13. W. Whitt, “An interesting example of a multiclass queueing network,” AT&T Bell Laboratories, Murray Hill, NJ, Tech. Rep., 1992.
14. J. G. Dai and V. Nguyen, “On the convergence of multiclass queueing networks in heavy traffic,” Georgia Inst. Tech. and Massachusetts Inst. Tech., Tech. Rep., 1993.
15. J. F. C. Kingman, “The ergodic behaviour of random walks,” Biometrika, vol. 48, pp. 391-396, 1961.
16. G. Fayolle, “On random walks arising in queueing systems: Ergodicity and transience via quadratic forms as Lyapunov functions—part I,” Queueing Systems, vol. 5, pp. 167-184, 1989.
17. G. Fayolle, V. A. Malyshev, M. V. Mensikov, and A. F. Sidorenko, “Lyapunov Rapports functions for Jackson networks,” INRIA. Rocquencourt, France, de Recherche 1380, 1991.
18. S. P. Meyn and D. Down, “Stability of generalized Jackson networks,” Annals Applied Prob., to appear, 1993.
19. J. R. Jackson, “Jobshop-like queueing systems,” Management Sci., vol. 10, pp. 131-142, 1963.
20. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber, “Markov chains, computer proofs, and average-case analysis of best fit bin packing,” STOC 93, to appear, 1993.
21. D. Bertsimas, I. C. Paschalidis, and J. N. Tsitsiklis, “Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance,” Annals Applied Probability, vol. 4, pp. 43-75, 1994.
22. S. Kumar and P. R. Kumar, “Performance bounds for queueing networks and scheduling policies,” Trans. Automat. Contr., vol. 39, no. 8, pp. 1600-1611, 1994.
23. P. R. Kumar, “Re-entrant lines,” Queueing Systems: Theory and Applications: Special Issue on Queueing Networks, vol. 13, pp. 87-110, May 1993.
24. R. W. Cottle, G. J. Habetler, and C. E. Lemke, “On classes of copositive matrices,” Linear Algebra and Its Applications, vol. 3, pp. 295-310, 1970.
25. L.-E. Andersson, G. Chang, and T. Elfving, “Criteria for copositive matrices and non negative Bezier patches,” Linkoping Univ. and Univ. Science and Technology, China, Tech. Rep. LiTH-MAT-R-93-27, Aug. 1993.
26. K. G. Murty and S. N. Kabadi, “Some NP-complete problems in quadratic and nonlinear programming,” Mathematical Programming, vol. 39, pp. 117-129, 1987.
27. S. Lippman, “Applying a new device in the optimization of exponential queueing systems,” Op. Res., vol. 23, pp. 687-710, 1975.
28. S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability (Control and Communication in Engineering). London: Springer-Verlag, 1993.
29. S. P. Meyn and R. L. Tweedie, “Computable bounds for convergence rates of Markov chains,” 1993.
30. F. P. Kelly, Reversibility and Stochastic Networks, New York: Wiley, 1979.