About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Queueing Systems
Paper
On Markov-Krein characterization of the mean waiting time in M/G/K and other queueing systems
Abstract
We propose a new research direction to reinvigorate research into better understanding of the M/G/K and other queueing systems-via obtaining tight bounds on the mean waiting time as functions of the moments of the service distribution. Analogous to the classical Markov-Krein theorem, we conjecture that the bounds on the mean waiting time are achieved by service distributions corresponding to the upper/lower principal representations of the moment sequence. We present analytical, numerical, and simulation evidence in support of our conjectures. © 2011 Springer Science+Business Media, LLC.