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
Published in:
Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
(Volume:1
)
Date of Conference: 2000