Asymptotics and Uniform Bounds for Multiclass Queueing Networks
Chapter
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
Recently it has been shown in [2] that one can obtain linear programs which provide bounds on the coefficients , v in the expression $$ frac{{alpha N}}{{N + u }} $$ , which then bound the throughput for every population size N in a closed irreducible network. Also, it has been shown in [1] that one can obtain linear programs which provide bounds on the coefficients {c i } in the expansion $$ sum olimits_{{i = 0}}^{M} { frac{{{{c}_{i}} ho }}{{{{{(1 - ho )}}^{i}}}}} $$ , which then bounds the mean number in an open system for every nominal load p in the system. We provide a brief account of these results.