Delay moments for FIFO GI/GI/s queues
Queueing Systems: Theory and Applications
Further delay moment results for FIFO multiserver queues
Queueing Systems: Theory and Applications
Systems with multiple servers under heavy-tailed workloads
Performance Evaluation - Performance 2005
Surprising results on task assignment in server farms with high-variability workloads
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Performance Evaluation
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
Queueing Systems: Theory and Applications
On Markov---Krein characterization of the mean waiting time in M/G/K and other queueing systems
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
Most bounds for expected delay, \mathrm{E}[D], in GI/GI/c queues are modifications of bounds for the GI/GI/1 case. In this paper we exploit a new delay recursion for the GI/GI/c queue to produce bounds of a different sort when the traffic intensity \rho = \lambda / \mu = \mathrm{E}[S] / \mathrm{E}[T] is less than the integer portion of the number of servers divided by two. (S and T denote generic service and interarrival times, respectively.) We derive two different families of new bounds for expected delay, both in terms of moments of S and T. Our first bound is applicable when \mathrm{E}[S^2]. Our second bound for the first time does not require finite variance of S; it only involves terms of the form \mathrm{E}[S^\beta], where 1. We conclude by comparing our bounds to the best known bound of this type, as well as values obtained from simulation.