On Large Delays in Multi-Server Queues with Heavy Tails
arXiv:1104.3192 · doi:10.1287/moor.1120.0539
Abstract
We present upper and lower bounds for the tail distribution of the stationary waiting time in the stable 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 big jumps' in this case (here 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.
References in corpus (2)
Cited by in corpus (7)
- Operational Research: Methods and Applications
- Moments and tails in monotone-separable stochastic networks
- Customer sojourn time in GI/G/1 feedback queue in the presence of heavy tails
- Tail Asymptotics for Delay in a Half-loaded GI/GI/2 Queue with Heavy-tailed Job Sizes
- Heavy-tailed queues in the Halfin-Whitt regime
- A unified approach for large queue asymptotics in a heterogeneous multiserver queue
- Sample-path large deviations for a class of heavy-tailed Markov additive processes