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

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

  • 1994 33rd IEEE Conference on Decision and Control

published proceedings

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

author list (cited authors)

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

citation count

  • 8

complete list of authors

  • Kumar, PR||Meyn, S

publication date

  • January 1994

publisher