ACM SIGMETRICS Performance Evaluation Review
On the twin measure and queueing systems predictability
Performance Evaluation
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
Tail-robust scheduling via limited processor sharing
Performance Evaluation
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
On Large Delays in Multi-Server Queues with Heavy Tails
Mathematics of Operations Research
| Hi-index | 0.00 |
Scheller-Wolf [12] established necessary and sufficient conditions for finite stationary delay moments in stable FIFO GI/GI/s queues that incorporate the interaction between service time distribution, traffic intensity (驴) and the number of servers in the queue. These conditions can be used to show that when the service time has finite first but infinite 驴th moment, s slow servers can give lower delays than one fast server. In this paper, we derive an alternative derivation of these moment results: Both upper bounds, that serve as sufficient conditions, and lower bounds, that serve as necessary conditions are presented. In addition, we extend the class of service time distributions for which the necessary conditions are valid. Our new derivations provide a structural interpretation of the moment bounds, giving intuition into their origin: We show that FIFO GI/GI/s delay can be represented as the minimum of (s 驴 k) i.i.d. GI/GI/1 delays, when 驴 satisfies k k+1.