Performance Distributions of Queues with Batch Renewal Arrivals: GI/M/1/N and GI/Geo/1/N

نویسندگان

  • Wei Li
  • Rod Fretwell
  • Demetres Kouvatsos
چکیده

It has been proven that the batch renewal process is the least biased choice of traffic process given the infinite sets of measures of the traffic correlation, (i.e. indices of dispersion, covariances or correlation functions) in the discrete time domain. The same conclusion is expected to hold in the continuous time domain. That motivates the study and comparison of similar queues, fed by batch renewal traffic, in both domains. In this paper, performance distributions are obtained for the GI/M/1/N queue in continuous time and compared with the corresponding results for the GI/Geo/1/N queue in discrete time. The expressions for queue length distribution, blocking probability and waiting time distributions are derived. They can be used to assess the adverse effect on buffer performance that is induced by traffic correlation.

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

ثبت نام

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

منابع مشابه

A Unified Analysis to the Queue Length Distributions in MX(k)/G/1/N and GI/MY(k)/1/N Queues

, Abstract We study an eMcient iterative algorithm fbr computing the stationary distributions ih MX/G/IZN queues with arbitrary state-dependent arrivals, that is, ., MX(k)/C/1/N queues. MX(k)/G/1/N queues include the well studied specidl cases, such as PBAS (partially batch acceptance strategy) At(,X/G/1/N queues and tt WBAS (whole batch acceptance strategy) MX/C/1/N queues. We only require the...

متن کامل

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 ...

متن کامل

Asymptotics for Steady-state Tail Probabilities in Structured Markov Queueing Models

In this paper we establish asymptotics for the basic steady-state distributions in a large class of single-server queues. We consider the waiting time, the workload (virtual waiting time) and the steady-state queue lengths at an arbitrary time, just before an arrival and just after a departure. We start by establishing asymptotics for steady-state distributions of Markov chains of M/GI/1 type. ...

متن کامل

Approximations for Heavily-Loaded G/GI/n +GI Queues

Motivated by applications to service systems, we develop simple engineering approximation formulas for the steady-state performance of heavily-loaded G/GI/n+GI multi-server queues, which can have non-Poisson and non-renewal arrivals and non-exponential service-time and patience-time distributions. The formulas are based on recently established Gaussian manyserver heavy-traffic limits, but invol...

متن کامل

Error Bounds for Perturbing Nonexponential Queues

A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in singleand multi-server queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N , M/G/c/N , and GI/M/c/N . First, for the standard GI/G/1/N queue, it is illustrated ho...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2006