A linear programming approach to uniform functional expansions, heavy traffic pole multiplicities, and uniform stability for open queueing networks

摘要

We study open queueing networks. We provide linear programs to obtain the coefficients C/sub i/ that supply upper or lower bounds of the form /spl rho/C/sub M//(1-/spl rho/)/sup M/+/spl rho/C/sub M-1//(1-/spl rho/)/sup M-1/+/spl middot//spl middot//spl middot/+/spl rho/C/sub 0/.