Title :
A unified approach to linear programming bounds for queueing networks: systems with polyhedral invariance of transition probabilities
Author :
Morrison, James R. ; Kumar, P.R.
Abstract :
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
Keywords :
Markov processes; directed graphs; duality (mathematics); linear programming; probability; queueing theory; LP; Markov chain model; linear programming bounds; performance-to-performance duality; polyhedral invariance; queueing networks; transition probabilities; translational invariance; Contracts; Cost function; Fluctuations; Linear programming; Lyapunov method; Scheduling; Semiconductor device modeling; Smoothing methods; Stability; State-space methods;
Conference_Titel :
Decision and Control, 2000. Proceedings of the 39th IEEE Conference on
Conference_Location :
Sydney, NSW
Print_ISBN :
0-7803-6638-7
DOI :
10.1109/CDC.2000.912821
