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
The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution
Queueing Systems: Theory and Applications
Heavy Tails in Multi-Server Queue
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Fluid Queues with Heavy-Tailed M/G/∞ Input
Mathematics of Operations Research
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We present upper and lower bounds for the tail distribution of the stationary waiting time D in the stable GI/GI/s first-come first-served (FCFS) queue. These bounds depend on the value of the traffic load ρ which is the ratio of mean service and mean interarrival times. For service times with intermediate regularly varying tail distribution the bounds are exact up to a constant, and we are able to establish a “principle of s-k big jumps” in this case (here k is the integer part of ρ), which gives the most probable way for the stationary waiting time to be large. Another corollary of the bounds obtained is to provide a new proof of necessity and sufficiency of conditions for the existence of moments of the stationary waiting time.