A linear programming approach to uniform functional expansions, heavy traffic pole multiplicities, and uniform stability for open queueing networks
Conference Paper
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
We study open queueing networks. We provide linear programs to obtain the coefficients C i that supply upper or lower bounds of the form C M /(1 - ) M + C M-1 /(1 - ) M-1 + . . . + C 0 .
name of conference
Proceedings of 1995 34th IEEE Conference on Decision and Control