Uniform approximations for the M/G/1 queue with subexponential processing times

Uniform approximations for the M/G/1 queue with subexponential processing times

0.00 Avg rating0 Votes
Article ID: iaor20115779
Volume: 68
Issue: 1
Start Page Number: 1
End Page Number: 50
Publication Date: May 2011
Journal: Queueing Systems
Authors: ,
Keywords: approximation, heavy traffic, random walk, M/GI/1 queues
Abstract:

This paper studies the asymptotic behavior of the steady‐state waiting time, W , of the M/G/1 queue with Subexponential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide insights into the regions of large deviations where the so‐called heavy‐traffic approximation and heavy‐tail asymptotic hold. For queues whose service time distribution decays slower than e t equ1 we identify a third region of asymptotics where neither the heavy‐traffic nor the heavy‐tail approximations are valid. These results are obtained by deriving approximations for P(W >x) that are either uniform in the traffic intensity as the tail value goes to infinity or uniform on the positive axis as the traffic intensity converges to one. Our approach makes clear the connection between the asymptotic behavior of the steady‐state waiting time distribution and that of an associated random walk.

Reviews

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