Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula

Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula

0.00 Avg rating0 Votes
Article ID: iaor20031655
Country: United Kingdom
Volume: 30
Issue: 3
Start Page Number: 353
End Page Number: 365
Publication Date: Mar 2003
Journal: Computers and Operations Research
Authors: ,
Keywords: GI/G/1 queues, Little's law
Abstract:

In this paper, we consider the steady-state queue length distribution of the GI/G/1/K queue. As a result, we obtain transform-free expressions for the steady-state queue length distributions at an arrival, at a departure and at an arbitrary time, all in product forms. The results are obtained by what we call the decomposed Little's formula, which applies the Little's formula L=λW to the nth waiting position in the queue. Utilizing the results, we improve and generalize existing bounds on the difference between the time average and arrival (departure) average mean queue lengths, and propose a two-moment approximation for the queue length. To evaluate the approximation, we focus on the probability of customer loss and the mean queue length, which are of great practical importance. Our approximations turn out to be remarkably simple yet fairly good especially in heavy traffic.

Reviews

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