Some results for the mean waiting-time and workload in GI/GI/k queues
Frontiers in queueing
New bounds for expected delay in FIFO GI/GI/c queues
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects
Manufacturing & Service Operations Management
A Diffusion Approximation for the G/GI/n/m Queue
Operations Research
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
SIAM Journal on Optimization
Heavy Tails in Multi-Server Queue
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
A semidefinite optimization approach to the steady-state analysis of queueing systems
Queueing Systems: Theory and Applications
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
Queueing Systems: Theory and Applications
Semidefinite optimization for transient analysis of queues
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hi-index | 0.00 |
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.