Transform-free analysis of the GI/G/1/K queue through the decomposed Littles formula

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 = lambdaW 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.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2003-03
Language
ENG
Keywords

SYSTEMS

Citation

COMPUTERS OPERATIONS RESEARCH, v.30, no.3, pp.353 - 365

ISSN
0305-0548
DOI
10.1016/S0305-0548(01)00101-0
URI
http://hdl.handle.net/10203/1335
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
2 COR paper by Kim and Chae.pdf(75.51 kB)Download
  • Hit : 735
  • Download : 744
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 14 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0