Lower bounds for the probability of overload in certain queueing networks

Publisher Website
Google Scholar
Abstract
Conservative estimates for the probability that open queueing networks are not overloaded during any finite set of time points are derived. The queueing networks have infinitely many servers at each queue and general service times. A key preliminary result is that for multidimensional Markov population processes, the correspondence between initial distributions and their temporal development preserves stochastic order.

This publication has 2 references indexed in Scilit: