Use of erlangian distributions for single-server queueing systems

1969 ◽  
Vol 6 (3) ◽  
pp. 584-593 ◽  
Author(s):  
T. C. T. Kotiah ◽  
J. W. Thompson ◽  
W. A. O'N. Waugh
Keyword(s):  
Queue Length ◽  
Queueing Systems ◽  
Single Server ◽  
System A ◽  
Bulk Service ◽  
Mean And Variance ◽  
The Mean ◽  
Mean Queue Length ◽  
Mean Time ◽  
Server System

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.

Use of erlangian distributions for single-server queueing systems

1969 ◽  
Vol 6 (03) ◽  
pp. 584-593 ◽  
Author(s):  
T. C. T. Kotiah ◽  
J. W. Thompson ◽  
W. A. O'N. Waugh
Keyword(s):  
Queue Length ◽  
Queueing Systems ◽  
Single Server ◽  
System A ◽  
Bulk Service ◽  
Mean And Variance ◽  
The Mean ◽  
Mean Queue Length ◽  
Mean Time ◽  
Server System

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

On a tandem queueing model with identical service times at both counters, II

1979 ◽  
Vol 11 (3) ◽  
pp. 644-659 ◽  
Author(s):  
O. J. Boxma
Keyword(s):  
Heavy Traffic ◽  
Queueing Systems ◽  
Single Server ◽  
Service Time Distribution ◽  
In Series ◽  
Mean And Variance ◽  
Queues In Series ◽  
The Mean ◽  
Service Times ◽  
Practical Implications

This paper is devoted to the practical implications of the theoretical results obtained in Part I [1] for queueing systems consisting of two single-server queues in series in which the service times of an arbitrary customer at both queues are identical. For this purpose some tables and graphs are included. A comparison is made—mainly by numerical and asymptotic techniques—between the following two phenomena: (i) the queueing behaviour at the second counter of the two-stage tandem queue and (ii) the queueing behaviour at a single-server queue with the same offered (Poisson) traffic as the first counter and the same service-time distribution as the second counter. This comparison makes it possible to assess the influence of the first counter on the queueing behaviour at the second counter. In particular we note that placing the first counter in front of the second counter in heavy traffic significantly reduces both the mean and variance of the total time spent in the second system.

On a tandem queueing model with identical service times at both counters, II

1979 ◽  
Vol 11 (03) ◽  
pp. 644-659 ◽  
Author(s):  
O. J. Boxma
Keyword(s):  
Heavy Traffic ◽  
Queueing Systems ◽  
Single Server ◽  
Service Time Distribution ◽  
In Series ◽  
Mean And Variance ◽  
Queues In Series ◽  
The Mean ◽  
Service Times ◽  
Practical Implications

This paper is devoted to the practical implications of the theoretical results obtained in Part I [1] for queueing systems consisting of two single-server queues in series in which the service times of an arbitrary customer at both queues are identical. For this purpose some tables and graphs are included. A comparison is made—mainly by numerical and asymptotic techniques—between the following two phenomena: (i) the queueing behaviour at the second counter of the two-stage tandem queue and (ii) the queueing behaviour at a single-server queue with the same offered (Poisson) traffic as the first counter and the same service-time distribution as the second counter. This comparison makes it possible to assess the influence of the first counter on the queueing behaviour at the second counter. In particular we note that placing the first counter in front of the second counter in heavy traffic significantly reduces both the mean and variance of the total time spent in the second system.

scholarly journals The Correlation Coefficients of the Queue Lengths of Some Stationary Single Server Queues

1971 ◽  
Vol 12 (1) ◽  
pp. 35-46 ◽  
Author(s):  
A. G. Pakes
Keyword(s):  
Queue Length ◽  
Final Section ◽  
Waiting Times ◽  
Queueing Systems ◽  
Correlation Coefficients ◽  
Second Order ◽  
Single Server ◽  
Bulk Service ◽  
Queue Lengths ◽  
Queueing Processes

Until recently there has been little systematic work on the second-order properties of queueing processes. The aim of this paper is to study systematically the second-order properties of the queue length processes embedded at departure epochs in the M/G/1 and bulk service M/G/1 queues, and at arrival epochs in the GI/M/1 queue. In the latter case our results extend those of Daley [7], while in the ordinary M/G/1 queue our work parallels Daley's [6] discussion of waiting times in the same system. In the final section we briefly discuss two discrete time queueing systems.

Reliability Analysis of a System with Multiple-Stage Policy Considering Type I and II Errors

2019 ◽  
Vol 26 (06) ◽  
pp. 1950028
Author(s):  
Mitsuhiro Imaizumi ◽  
Mitsutaka Kimura
Keyword(s):  
Type I Error ◽  
The Other ◽  
Renewal Processes ◽  
Type I ◽  
Numerical Examples ◽  
Markov Renewal Processes ◽  
The Mean ◽  
Mean Time ◽  
Server System ◽  
Multiple Stages

This paper formulates a stochastic model for a system with illegal access. The server has the function of IDS, and illegal access is checked in multiple stages which consist of simple check and detailed check. In this model, we consider type I and II errors of simple check and a type I error of detailed check. There are two cases where IDS judges the occurrence of illegal access erroneously. One is when illegal access does not occur, and the other is when illegal access occurs. We apply the theory of Markov renewal processes to a system with illegal access, and derive the mean time and the expected checking number until a server system becomes faulty. Further, an optimal policy which minimizes the expected cost is discussed. Finally, numerical examples are given.

The steady-state solution of the M/K2/m queue

1980 ◽  
Vol 12 (03) ◽  
pp. 799-823
Author(s):  
Per Hokstad
Keyword(s):  
Steady State ◽  
Queue Length ◽  
Simple Formula ◽  
Length Distribution ◽  
Steady State Solution ◽  
Queue Length Distribution ◽  
Server Queue ◽  
The Mean ◽  
Mean Queue Length ◽  
The Many

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.

The disasters queue with working breakdowns and impatient customers

2020 ◽  
Vol 54 (3) ◽  
pp. 815-825
Author(s):  
Mian Zhang ◽  
Shan Gao
Keyword(s):  
Size Distribution ◽  
Performance Measures ◽  
Sojourn Time ◽  
Queue Length ◽  
Slow Rate ◽  
System Size ◽  
Impatient Customers ◽  
Numerical Examples ◽  
The Mean ◽  
Mean Queue Length

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.

A conservation law for single-server queues and its applications

1991 ◽  
Vol 28 (1) ◽  
pp. 198-209 ◽  
Author(s):  
Genji Yamazaki ◽  
Hirotaka Sakasegawa ◽  
J. George Shanthikumar
Keyword(s):  
Conservation Law ◽  
Extremal Property ◽  
Service Discipline ◽  
Single Server ◽  
Processor Sharing ◽  
Equilibrium Equations ◽  
Common Mean ◽  
The Mean ◽  
Mean Queue Length ◽  
Basic Equations

We establish a conservation law for G/G/1 queues with any work-conserving service discipline using the equilibrium equations, also called the basic equations. We use this conservation law to prove an extremal property of the first-come firstserved (FCFS) service discipline: among all service disciplines that are work-conserving and independent of remaining service requirements for individual customers, the FCFS service discipline minimizes [maximizes] the mean sojourn time in a G/G/1 queue with independent (but not necessarily identical) service times with a common mean and new better [worse] than used (NBUE[NWUE]) distributions. This extends recent results of Halfin and Whitt (1990), Righter et al. (1990) and Yamazaki and Sakasegawa (1987a,b). In addition we use the conservation law to obtain an approximation for the mean queue length in a GI/GI/1 queue under the processor-sharing service discipline with finite degree of multiplicity, called LiPS discipline. Several numerical examples are presented which support the practical usefulness of the proposed approximation.

The steady-state solution of the M/K2/m queue

1980 ◽  
Vol 12 (3) ◽  
pp. 799-823 ◽  
Author(s):  
Per Hokstad
Keyword(s):  
Steady State ◽  
Queue Length ◽  
Simple Formula ◽  
Length Distribution ◽  
Steady State Solution ◽  
Queue Length Distribution ◽  
Server Queue ◽  
The Mean ◽  
Mean Queue Length ◽  
The Many

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.

Sign in / Sign up

Export Citation Format

Share Document