By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kumar, P.R. ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA ; Meyn, S.P.

We consider the problems of performance analysis and stability/instability determination of queuing networks and scheduling policies. We exhibit a strong duality relationship between the performance of a system and its stability analysis via mean drift. We obtain a variety of linear programs (LPs) to conduct such stability and performance analyses. A certain LP, called the performance LP, bounds the performance of all stationary nonidling 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, showing that all stationary nonidling scheduling policies result in a geometrically converging exponential moment. These results carry over to fluid models, allowing the study of networks with nonexponential distributions. If a modification of the performance LP, called the monotone LP, is bounded, then the system is stable. Finally, there is a another modification of the performance LP, called the finite time LP. It provides transient bounds on the performance of the system from any initial condition

Published in:

Automatic Control, IEEE Transactions on  (Volume:41 ,  Issue: 1 )