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

abstract

• A variety of linear programs to conduct the performance analysis and stability/instability determination of queueing networks and scheduling policies was obtained. A strong duality relationship between the performance of a system, and its stability analysis was exhibited. 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, thus, it is concluded that all stationary non-idling scheduling policies are stable in the very strong sense of having a geometrically converging exponential moment.

name of conference

• Proceedings of 1994 33rd IEEE Conference on Decision and Control

authors

• Kumar, Panganamala

published proceedings

• Proceedings of 1994 33rd IEEE Conference on Decision and Control

author list (cited authors)

• Kumar, P. R., & Meyn, S.

citation count

• 7

complete list of authors

• Kumar, PR||Meyn, S

publication date

• January 1994

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Conference on Decision and Control  Journal

Digital Object Identifier (DOI)

• 10.1109/cdc.1994.411003

start page

• 524-529 vol.1

end page

• 529

volume

• 1

URL

• http://dx.doi.org/10.1109/cdc.1994.411003