Approximations for the mean queue length of the queue

2006 ◽  
Vol 34 (2) ◽  
pp. 205-213 ◽  
Author(s):  
Thomas Hanschke
1980 ◽  
Vol 12 (03) ◽  
pp. 799-823
Author(s):  
Per Hokstad

The many-server queue with service time having rational Laplace transform of order 2 is considered. An expression for the asymptotic queue-length distribution is obtained. A relatively simple formula for the mean queue length is also found. A few numerical results on the mean queue length and on the probability of having to wait are given for the case of three servers. Some approximations for these quantities are also considered.


2020 ◽  
Vol 54 (3) ◽  
pp. 815-825
Author(s):  
Mian Zhang ◽  
Shan Gao

We consider the M/M/1 queue with disasters and impatient customers. Disasters only occur when the main server being busy, it not only removes out all present customers from the system, but also breaks the main server down. When the main server is down, it is sent for repair. The substitute server serves the customers at a slow rate(working breakdown service) until the main server is repaired. The customers become impatient due to the working breakdown. The system size distribution is derived. We also obtain the mean queue length of the model and mean sojourn time of a tagged customer. Finally, some performance measures and numerical examples are presented.


1980 ◽  
Vol 12 (3) ◽  
pp. 799-823 ◽  
Author(s):  
Per Hokstad

The many-server queue with service time having rational Laplace transform of order 2 is considered. An expression for the asymptotic queue-length distribution is obtained. A relatively simple formula for the mean queue length is also found. A few numerical results on the mean queue length and on the probability of having to wait are given for the case of three servers. Some approximations for these quantities are also considered.


1968 ◽  
Vol 5 (3) ◽  
pp. 591-606 ◽  
Author(s):  
G. F. Newell

The arrival rate of customers to a service facility is assumed to have the form λ(t) = λ(0) — βt2 for some constant β. Diffusion approximations show that for λ(0) sufficiently close to the service rate μ, the mean queue length at time 0 is proportional to β–1/5. A dimensionless form of the diffusion equation is evaluated numerically from which queue lengths can be evaluated as a function of time for all λ(0) and β. Particular attention is given to those situations in which neither deterministic queueing theory nor equilibrium stochastic queueing theory apply.


1995 ◽  
Vol 43 (1) ◽  
pp. 158-165 ◽  
Author(s):  
Bobby N. W. Ma ◽  
Jon W. Mark

2000 ◽  
Vol 37 (04) ◽  
pp. 1092-1098
Author(s):  
Olivier Brun ◽  
Jean-Marie Garcia

Although the M/D/1/N queueing model is well solved from a computational point of view, there is no known analytical expression of the queue length distribution. In this paper, we derive closed-form formulae for the distribution of the number of customers in the system in the finite-capacity M/D/1 queue. We also give an explicit solution for the mean queue length and the average waiting time.


1969 ◽  
Vol 6 (3) ◽  
pp. 584-593 ◽  
Author(s):  
T. C. T. Kotiah ◽  
J. W. Thompson ◽  
W. A. O'N. Waugh

SummaryThe use of Erlangian distributions has been proposed for the approximation of more general types of distributions of interarrival and service times in single-server queueing systems. Any Erlangian approximation should have the same mean and variance as the distribution it approximates, but it is not obvious what effect the various possible approximants have on the behaviour of the system. A major difference between approximants is their degree of skewness and accordingly, numerical results for various approximants are obtained for (a) the mean time spent by a customer in a simple single-server system, and (b) the mean queue length in a system with bulk service. Skewness is shown to have little effect on these quantities.


2015 ◽  
Vol 16 (3) ◽  
pp. 190-196 ◽  
Author(s):  
Ilya B. Gertsbakh

Abstract We assume that a Poisson flow of vehicles arrives at isolated signalized intersection, and each vehicle, independently of others, represents a random number X of passenger car units (PCU’s). We analyze numerically the stationary distribution of the queue process {Zn}, where Zn is the number of PCU’s in a queue at the beginning of the n-th red phase, n → ∞. We approximate the number Yn of PCU’s arriving during one red-green cycle by a two-parameter Negative Binomial Distribution (NBD). The well-known fact is that {Zn} follow an infinite-state Markov chain. We approximate its stationary distribution using a finite-state Markov chain. We show numerically that there is a strong dependence of the mean queue length E[Zn] in equilibrium on the input distribution of Yn and, in particular, on the ”over dispersion” parameter γ= Var[Yn]/E[Yn]. For Poisson input, γ = 1. γ > 1 indicates presence of heavy-tailed input. In reality it means that a relatively large ”portion” of PCU’s, considerably exceeding the average, may arrive with high probability during one red-green cycle. Empirical formulas are presented for an accurate estimation of mean queue length as a function of load and g of the input flow. Using the Markov chain technique, we analyze the mean ”virtual” delay time for a car which always arrives at the beginning of the red phase.


1968 ◽  
Vol 5 (03) ◽  
pp. 591-606 ◽  
Author(s):  
G. F. Newell

The arrival rate of customers to a service facility is assumed to have the formλ(t) =λ(0) —βt2for some constantβ.Diffusion approximations show that forλ(0) sufficiently close to the service rateμ, the mean queue length at time 0 is proportional toβ–1/5. A dimensionless form of the diffusion equation is evaluated numerically from which queue lengths can be evaluated as a function of time for allλ(0) andβ.Particular attention is given to those situations in which neither deterministic queueing theory nor equilibrium stochastic queueing theory apply.


Sign in / Sign up

Export Citation Format

Share Document