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

نویسندگان

  • Nam K. Kim
  • Kyung C. Chae
چکیده

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 W L λ = to the n 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 twomoment approximation for the queue length. To evaluate the approximation, we focus * Tel: +82-42-869-2915; Fax: +82-42-869-3110. E-mail address: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculation of the Gi/g/1 Waiting-time Distribution and Its Cumulants from Pollaczek’s Formulas

The steady-state waiting time in a stable GI/G/1 queue is equivalent to the maximum of a general random walk with negative drift. Thus, the distribution of the steady-state waiting time in the GI/G/1 queue is characterized by Spitzer’s (1956) formula. However, earlier, Pollaczek (1952) derived an equivalent contour-integral expression for the Laplace transform of the GI/G/1 steady-state waiting...

متن کامل

M M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...

متن کامل

Representing Workloads in GI/G/1 Queues Through the Preemptive-Resume LIFO Queue Discipline

We give in this paper a detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline: We study the long-run “state” behavior of the system by averaging over arrival epochs, departure epochs, as well as time, and obtain relations that express the resulting averages in terms of basic characteristics within busy cycles. These relations, tog...

متن کامل

A Unified Method to Analyze Overtake Free Queueing Systems

In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L(Q) and the time a customer spends in the system (queue), S(W) under the first-in-first-out (FIFO) discipline are special cases of the H = AG law and lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional aws for both L ...

متن کامل

THE MacLaurin SERIES FOR THE GI/G/1 QUEUE

We derive the MacLaurin series for the moments of the system time and the delay with respect to the parameters in the service time or interarrival time distributions in the GI/G/1 queue. The coe cients in these series are expressed in terms of the derivatives of the interarrival time density function evaluated at zero and the moments of the service time distribution, which can be easily calcula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2003