The Trivariate Distribution of the Maximum Queue Length, the Number of Customers Served and the Duration of the Busy Period for the M/G/1 Queueing System

1969 ◽  
Vol 6 (01) ◽  
pp. 154-161 ◽  
Author(s):  
E.G. Enns
Keyword(s):  
Queue Length ◽  
Busy Period ◽  
Queueing System ◽  
Single Server ◽  
List Type ◽  
Type Number ◽  
Distribution Of The Maximum ◽  
Maximum Queue Length ◽  
Number Of Customers

In the study of the busy period for a single server queueing system, three variables that have been investigated individually or at most in pairs are: 1. The duration of the busy period. 2. The number of customers served during the busy period. 3. The maximum number of customers in the queue during the busy period.

The Trivariate Distribution of the Maximum Queue Length, the Number of Customers Served and the Duration of the Busy Period for the M/G/1 Queueing System

1969 ◽  
Vol 6 (1) ◽  
pp. 154-161 ◽  
Author(s):  
E.G. Enns
Keyword(s):  
Queue Length ◽  
Busy Period ◽  
Queueing System ◽  
Single Server ◽  
List Type ◽  
Type Number ◽  
Distribution Of The Maximum ◽  
Maximum Queue Length ◽  
Number Of Customers

In the study of the busy period for a single server queueing system, three variables that have been investigated individually or at most in pairs are:1.The duration of the busy period.2.The number of customers served during the busy period.3.The maximum number of customers in the queue during the busy period.

The general N server finite queue

1971 ◽  
Vol 8 (04) ◽  
pp. 828-834 ◽  
Author(s):  
Asha Seth Kapadia
Keyword(s):  
Waiting Time ◽  
Busy Period ◽  
Queueing System ◽  
List Type ◽  
Type Number ◽  
Stochastic Nature ◽  
Mean Waiting Time ◽  
Queue Discipline ◽  
Mean And Variance ◽  
The Mean

Kingman (1962) studied the effect of queue discipline on the mean and variance of the waiting time. He made no assumptions regarding the stochastic nature of the input and the service distributions, except that the input and service processes are independent of each other. When the following two conditions hold: (a) no server sits idle while there are customers waiting to be served; (b) the busy period is finite with probability one (i.e., the queue empties infinitely often with probability one); he has shown that the mean waiting time is independent of the queue discipline and the variance of the waiting time is a minimum when the customers are served in order of their arrival. Conditions (a) and (b) will henceforward be called Kingman conditions and a queueing system satisfying Kingman conditions will be referred to in the text as a Kingman queue.

The general N server finite queue

1971 ◽  
Vol 8 (4) ◽  
pp. 828-834 ◽  
Author(s):  
Asha Seth Kapadia
Keyword(s):  
Waiting Time ◽  
Busy Period ◽  
Queueing System ◽  
List Type ◽  
Type Number ◽  
Stochastic Nature ◽  
Mean Waiting Time ◽  
Queue Discipline ◽  
Mean And Variance ◽  
The Mean

Kingman (1962) studied the effect of queue discipline on the mean and variance of the waiting time. He made no assumptions regarding the stochastic nature of the input and the service distributions, except that the input and service processes are independent of each other. When the following two conditions hold: (a)no server sits idle while there are customers waiting to be served;(b)the busy period is finite with probability one (i.e., the queue empties infinitely often with probability one); he has shown that the mean waiting time is independent of the queue discipline and the variance of the waiting time is a minimum when the customers are served in order of their arrival. Conditions (a) and (b) will henceforward be called Kingman conditions and a queueing system satisfying Kingman conditions will be referred to in the text as a Kingman queue.

scholarly journals Single server queues with modified service mechanisms

1962 ◽  
Vol 2 (4) ◽  
pp. 499-507 ◽  
Author(s):  
G. F. Yeo
Keyword(s):  
Time Distribution ◽  
Busy Period ◽  
Queueing System ◽  
Probability Generating Function ◽  
Single Server ◽  
Waiting Time Distribution ◽  
Period Distribution ◽  
Time Dependent Problem ◽  
Stationary Waiting Time ◽  
Special Case

SummaryThis paper considers a generalisation of the queueing system M/G/I, where customers arriving at empty and non-empty queues have different service time distributions. The characteristic function (c.f.) of the stationary waiting time distribution and the probability generating function (p.g.f.) of the queue size are obtained. The busy period distribution is found; the results are generalised to an Erlangian inter-arrival distribution; the time-dependent problem is considered, and finally a special case of server absenteeism is discussed.

An Uncertain Single-Server Queueing Model

2021 ◽  
pp. 2150001
Author(s):  
Kai Yao
Keyword(s):  
Queueing Theory ◽  
Busy Period ◽  
Queueing System ◽  
Single Server ◽  
Queueing Model ◽  
Uncertainty Distribution ◽  
Uncertain Variables ◽  
Service Efficiency ◽  
Service Times ◽  
Interarrival Times

In the queueing theory, the interarrival times between customers and the service times for customers are usually regarded as random variables. This paper considers human uncertainty in a queueing system, and proposes an uncertain queueing model in which the interarrival times and the service times are regarded as uncertain variables. The busyness index is derived analytically which indicates the service efficiency of a queueing system. Besides, the uncertainty distribution of the busy period is obtained.

The distribution of the maximum number of customers present simultaneously during a busy period for the queueing systems M/G/1 and G/M/1

1967 ◽  
Vol 4 (01) ◽  
pp. 162-179 ◽  
Author(s):  
J. W. Cohen
Keyword(s):  
Busy Period ◽  
Transition Probabilities ◽  
Queueing Systems ◽  
Entrance Time ◽  
Distribution Of The Maximum ◽  
Number Of Customers

The distribution of the maximum number of customers simultaneously present during a busy period is studied for the queueing systems M/G/1 and G/M/1. These distributions are obtained by using taboo probabilities. Some new relations for transition probabilities and entrance time distributions are derived.

On a property of a refusals stream

1997 ◽  
Vol 34 (03) ◽  
pp. 800-805 ◽  
Author(s):  
Vyacheslav M. Abramov
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Busy Period ◽  
Elementary Proof ◽  
Queueing System ◽  
Queueing Systems ◽  
Single Server ◽  
Wide Family

This paper consists of two parts. The first part provides a more elementary proof of the asymptotic theorem of the refusals stream for an M/GI/1/n queueing system discussed in Abramov (1991a). The central property of the refusals stream discussed in the second part of this paper is that, if the expectations of interarrival and service time of an M/GI/1/n queueing system are equal to each other, then the expectation of the number of refusals during a busy period is equal to 1. This property is extended for a wide family of single-server queueing systems with refusals including, for example, queueing systems with bounded waiting time.

scholarly journals Concavity of the throughput of tandem queueing systems with finite buffer storage space

1990 ◽  
Vol 22 (03) ◽  
pp. 764-767 ◽  
Author(s):  
Ludolf E. Meester ◽  
J. George Shanthikumar
Keyword(s):  
Queueing System ◽  
Queueing Systems ◽  
Sample Path ◽  
Concave Function ◽  
Time Interval ◽  
Single Server ◽  
Finite Buffer ◽  
Buffer Storage ◽  
Unlimited Supply ◽  
Number Of Customers

We consider a tandem queueing system with m stages and finite intermediate buffer storage spaces. Each stage has a single server and the service times are independent and exponentially distributed. There is an unlimited supply of customers in front of the first stage. For this system we show that the number of customers departing from each of the m stages during the time interval [0, t] for any t ≧ 0 is strongly stochastically increasing and concave in the buffer storage capacities. Consequently the throughput of this tandem queueing system is an increasing and concave function of the buffer storage capacities. We establish this result using a sample path recursion for the departure processes from the m stages of the tandem queueing system, that may be of independent interest. The concavity of the throughput is used along with the reversibility property of tandem queues to obtain the optimal buffer space allocation that maximizes the throughput for a three-stage tandem queue.

scholarly journals A discrete single server queue with Markovian arrivals and phase type group services

1995 ◽  
Vol 8 (2) ◽  
pp. 151-176 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
K. Laurie Dolhun ◽  
S. Chakravarthy
Keyword(s):  
Steady State ◽  
Queueing System ◽  
State Probability ◽  
Arrival Process ◽  
Single Server ◽  
Probability Vector ◽  
Phase Type Distribution ◽  
Steady State Probability ◽  
Phase Type ◽  
Number Of Customers

We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified) matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.

Sign in / Sign up

Export Citation Format

Share Document