Asymptotics and Uniform Bounds for Multiclass Queueing Networks Chapter uri icon

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.

author list (cited authors)

  • Kumar, P. R.

citation count

  • 0

complete list of authors

  • Kumar, PR

editor list (cited editors)

  • Glasserman, P., Sigman, K., & Yao, D. D.

Book Title

  • Stochastic Networks

publication date

  • January 1996