Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions

Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions

0.00 Avg rating0 Votes
Article ID: iaor20013038
Country: Netherlands
Volume: 33
Issue: 1/3
Start Page Number: 177
End Page Number: 204
Publication Date: Jan 1999
Journal: Queueing Systems
Authors: ,
Keywords: GI/G/1 queues
Abstract:

We consider a GI/G/1 queue in which the service time distribution and/or the interarrival time distribution has a heavy tail, so that the mean is finite but the variance is infinite. We prove a heavy-traffic limit theorem for the distribution of the stationary actual waiting time W. If the tail of the service time distribution is heavier than that of the interarrival time distribution, we give the conditions on the traffic load under which W, multiplied by an appropriate ‘coefficient of contraction’, converges in distribution to the Kovalenko distribution. If the tail of the interarrival time distribution is heavier than that of the service time distribution, we also give the conditions on the traffic load under which W, multiplied by another appropriate ‘coefficient of contraction’, converges in distribution to the negative exponential distribution.

Reviews

Required fields are marked *. Your email address will not be published.