Limits and approximations for the M/G/1 LIFO waiting-time distribution

نویسنده

  • J.
چکیده

We provide additional descriptions of the steady-state waiting-time distribution in the M/G/1 queue with the last-in firstout (LIFO) service discipline. We establish heavy-traffic limits for both the cumulative distribution function (cdf) and the moments. We develop an approximation for the cdf that is asymptotically correct both as the traffic intensity p ~ 1 for each time t and as t ~ oo for each p. We show that in heavy traffic the LIFO moments are related to the FIFO moments by the Catalan numbers. We also develop a new recursive algorithm for computing the moments. (~) 1997 Elsevier Science B.V.

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

ثبت نام

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

منابع مشابه

Limits and approximations for the M/G/1 LIFO waiting-time distribution

We provide additional descriptions of the steady-state waiting-time distribution in the M/G/1 queue with the last-in first-out (LIFO) service discipline. We establish heavy-traffic limits for both the cumulative distribution function (cdf) and the moments. We develop an approximation for the cdf that is asymptotically correct both as the traffic intensity ρ → 1 for each time t and as t → ∞ for ...

متن کامل

Calculating the M/G/1 busy-period density and LIFO waiting-time distribution by direct numerical transform inversion

It is well known that the M/G/1 busy-period density can be characterized by the Kendall functional equation for its Laplace transform. The Kendall functional equation can be solved iteratively to obtain transform values to use in numerical inversion algorithms. However, we show that the busy-period density can also be numerically inverted directly, without iterating a functional equation, explo...

متن کامل

A Diffusion Approximation for the G/GI/n/m Queue

We develop a diffusion approximation for the queue-length stochastic process in the G/GI/n/m queueing model (having a general arrival process, independent and identically distributed service times with a general distribution, n servers, and m extra waiting spaces). We use the steady-state distribution of that diffusion process to obtain approximations for steady-state performance measures of th...

متن کامل

Waiting-time tail probabilities in queues with long-tail service-time distributions

We consider the standard GI/G/1 queue with unlimited waiting room and the first-in first-out service discipline. We investigate the steady-state waiting-time tail probabilities P(W > x) when the service-time distribution has a long-tail distribution, i.e., when the service-time distribution fails to have a finite moment generating function. We have developed algorithms for computing the waiting...

متن کامل

Heavy-traffic extreme-value limits for queues

We consider the maximum waiting time among the first n customers in the GI/G/1 queue. We use strong approximations to prove, under regularity conditions, convergence of the normalized maximum wait to the Gumbel extreme-value distribution when the traffic intensity p approaches 1 from below and n approaches infinity at a suitable rate. The normalization depends on the interarrival-time and servi...

متن کامل

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


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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997