Computational Performance Bounds for Markov Chains With Applications Academic Article uri icon

abstract

  • For Markov chains exhibiting translation invariance of their transition probabilities on polyhedra covering the state space, we develop computational performance bounds for key measures of system performance. Duality allows us to obtain linear programming performance bounds. The Markov chains considered can be used to model multiclass queueing networks operating under affine index policies, a class of policies which subsume many that have been proposed. © 2008 IEEE.

author list (cited authors)

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

citation count

  • 9

publication date

  • June 2008