A unified approach to linear programming bounds for queueing networks: systems with polyhedral invariance of transition probabilities Conference Paper uri icon


  • We develop a framework for obtaining linear programming performance bounds in queueing networks. The structure allowing for the development of the bounds requires that the underlying Markov chain model possess translational invariance of its transition probabilities on polyhedra. Such a structure is exhibited by many systems of interest. The bounds are then obtained via a performance-to-performance duality.

name of conference

  • Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187)

published proceedings

  • Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference

author list (cited authors)

  • Morrison, J. R., & Kumar, P. R.

citation count

  • 0

complete list of authors

  • Morrison, JR||Kumar, PR

publication date

  • January 2000