Queueing Theory-1

Basic Concept of Queueing Theory
Queueing System
Queueing Theory-1
Dr. S.D. Purohit
Department of HEAS (Mathematics), RTU Kota
Dr. S.D. Purohit, UD, RTU, Kota SPT, B.Tech. IV Semester (CS/IT)
Queueing System
What is the purpose of Queueing theory?
Queuing are the most frequently encountered problems in everyday life. For
example, queue at a cafeteria, library, bank, etc. Common to all of these
cases are the arrivals of objects requiring service and the attendant delays
when the service mechanism is busy. Waiting lines cannot be eliminated
completely, but suitable techniques can be used to reduce the waiting time
of an object in the system. A long waiting line may result in loss of
customers to an organization. Waiting time can be reduced by providing
additional service facilities, but it may result in an increase in the idle time
of the service mechanism.
Queueing System
Application of Queueing Model
Business situations (departmental stores, cinema halls, petrol pumps,

patients clinic, airlines counters etc.)
Scheduling of jobs in production control
Solution of inventory control
Queueing System
Basic Terminology
Key Elements of Queueing Systems
System Customer Server

Reception desk People Receptionist
Hospital Patients Nurses
Airport Airplanes Runway
Production line Cases Case-packer
Road network Cars Traffic light
Grocery Shoppers Checkout station
Computer Jobs CPU, disk, CD
Network Packets Router
Queueing System
Definition (Customers)
Persons or objects coming to service facility to get services is called
customers.
Definition (The Input (Arrival))

The statistical pattern of the arrival can be indicated through the probability
distribution of the number of the arrivals in an interval.
Queueing System
The input describes the manner in which the customers arrive and join the
queueing system. It is not possible to observe and control the actual
moment of arrival of a customer for service. Hence the number of arrivals in
one time period or the interval between successive arrivals is not treated as
a constant, but a random variable.
Therefore, the probability distribution of the number of arrivals per
unit of time or of the inter-arrival time is used to express the
mode of arrival of customers.
We shall deal with only those queueing systems in which the number of
arrivals per unit of time has a poisson distribution with mean λ. In this
case, the time between consecutive arrivals has an exponential distribution
1
with mean .
λ
Queueing System
Definition (Service Time)

The time taken by a server to complete service is known as service time.
Definition (Server)
It is a mechanism through which service is offered.
Queueing System
The mode of service is represented by means of the probability distribution

of the number of customers serviced per unit of time or of the inter-service
time.
We shall deal with only those queueing systems in which the number of
customers serviced per unit of time has a Poisson distribution with
mean µ or equivalently the inter-service time (viz. the time to complete
1
the service for a customer) has an exponential distribution with mean .
µ
Queueing System
Definition (Queue (Waiting lines))

Queue stands for the waiting in which incoming units stand and wait for
their turn of getting service at service facility.
Definition (Queue Discipline)

It is the order in which the members of the queue are offered service. That,
it is the rule accordingly to which customers are selected for service when
queue has been formed. The most common disciplines are
First Come First Services(FCFS)/ First In First Out (FIFO)
Last Come First Services(LCFS)/ Last In First Out(LIFO)
Random Service (RS)/ Service In Random Order(SIRO)
Queueing System
Definition (Busy Period)

The time devoted from first customer to the last in the queue is called busy
time.
Definition (Idle Period)

The time interval in between the completion of the service and the new
arrivals is called idle time.
Definition (Service Pattern)

The service mechanism is the way that customers receive service once they
are selected from the front of a queue. Another important parameter is the
number of servers. Systems with one server only are called Single Channel
Systems, systems with more servers are called Multi Channel Systems.
Queueing System
Queueing System
Definition (The States of the System)

The arrival and distribution of the service time are very important in queue
system. In any system, there are following three states:
Transient State: When the operating characterstics i.e. arrival,
waiting time, service time etc. are dependent on time.
Steady State: When the operating characterstics i.e. arrival, waiting
time, service time etc. are independent on time.
Explosive State: When the rate of arrivals is more that the rate of
service, then the waiting line increases indefinitely with time and will
ve infitine as t → ∞.
Note: Transient state is the case in the initial state of queue. Whereas, the
Steady state will reasch in the syatem after a long time. That is
lim Pn (t) = Pn (Independent of time t)

t→∞
Queueing System
Definition (Poisson Distribution)

A random variable X is said to be Poisson variate if its probability law
P (X = x) is as follows:
e−λ λx
P (X = x) = , x = 0, 1, 2, · · ·
x!
The constant λ > 0 is called the parameter of the distribution.
Theorem (Arrival Distribution Theorem (Random Observer Property))

Let n be a discrete random variable representing the number of arrivals in
some time interval of length t, and probability of an arrival in time
(t, t + ∆t), then n obays a Poisson distribution:
e−λt (λt)n
Pn (t) = ,
n!
where Pn (t) denotes the probability of n arrivals in time t.
Queueing System
Definition (Poisson Process)

It is a probabilistic phenomenon where the number of arrivals in an interval
of length t follows a Poisson distribution with parameter λ, where λ is the
rate of arrival.
Definition (Exponential Distribution)

The continuous random variable x is described according to the probability
law
f (x) = λe−λx , 0 < x < ∞
is called exponential variate with parameter λ and f is called exponential
distribution.
Theorem (Distribution of Inter-arrival times)

If the arrival pattern in a queue problem follows a Poisson process, then the
random variable T (The inter arrival time) follows the exponential
distribution and vice versa.
Queueing System
Definition (Erlang Service Time Distribution)

The continuous random variable t is described according to the probability
law
(µK)K K−1 −Kµt
f (t, µ, K) = t e , t ≥ 0, K ≥ 1.
(K − 1)!
is called Erlang variate with parameters µ and k, and f is called Erlang
distribution.
In particular, for K = 1, one can easily get the exponential disctribution.
Queueing System
Queueing System
Definition (Queuing Model)

It is a suitable model used to represent a service oriented problem, where
customers arrive randomly to receive some service, the service time being
also a random variable.
A queuing system can be completely described by

The input (or arrival Patten)
The service mechanism (or service pattern)
The queueing discipline
Customers behavior.
Queueing System
Symbolic Representation of a Queueing Model (Kendall Notation)
David George Kendall 1918-2007
Queueing System
Following D.G. Kendall, a queueing model is specified and represented

symbolically in the following form:
(a/b/c) : (d/e),
where
a denotes the type of distribution of the number of arrivals per unit
time
b the type of distribution of the service time
c the number of servers
d the capacity of the system, viz., the maximum queue size
e the queue discipline.
Queueing System
Accordingly, the first four models which we will deal with will be denoted
by the symbols:
1 (M/M/1) : (∞/F IF O)
2 (M/M/s) : (∞/F IF O)
3 (M/M/1) : (k/F IF O)
4 (M/M/s) : (k/F IF O)
In the above symbols the letter ’M ’ stands for Markov’ indicating that the
number of arrivals in time t and the number of completed services in time t
follow Poisson process which is a continuous time Markov chain.
Further, the symbole k represents the capacity of the system, and s is the
number of servers.
Queueing System
Operating characteristic of a Queueing System
General Performance Measures/ Symbols of Queueing Systems
Number of customers in system n (both waiting and in service)

Mean arrival rate λ (average number of customers arriving per unit of
time.)
1
Mean inter arrival time, time between arrivals =
λ
Mean service rate µ (average number of customer being served per unit
of time.)
1
Mean service time =
µ
λ
Traffic intensity ρ =
µ
Queueing System
Operating characteristic of a Queueing System
Average number of customers in the system E(Ns ) (Average number of

customers in the system Ls )
Average number of customers in the queue E(Nq ) (Average number of
customers in the queue or Average length of the queue Lq )
Average number Lw of customers in nonempty queues
Average waiting time of a customer in the system E(Ws )
Average waiting time of a customer in the queue E(Wq )
Steady-state probability of n customers in system Pn
Probability of n customers in system at time t, Pn (t)

Queueing Theory-1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Queueing Theory-1

Uploaded by

Copyright:

Available Formats

Basic Concept of Queueing Theory

Dr. S.D. Purohit

Department of HEAS (Mathematics), RTU Kota

What is the purpose of Queueing theory?

Application of Queueing Model

Business situations (departmental stores, cinema halls, petrol pumps,

Key Elements of Queueing Systems

System Customer Server

Definition (The Input (Arrival))

Definition (Service Time)

The mode of service is represented by means of the probability distribution

Definition (Queue (Waiting lines))

Definition (Queue Discipline)

Definition (Busy Period)

Definition (Idle Period)

Definition (Service Pattern)

Definition (The States of the System)

lim Pn (t) = Pn (Independent of time t)

Definition (Poisson Distribution)

Theorem (Arrival Distribution Theorem (Random Observer Property))

Definition (Poisson Process)

Definition (Exponential Distribution)

Theorem (Distribution of Inter-arrival times)

Definition (Erlang Service Time Distribution)

In particular, for K = 1, one can easily get the exponential disctribution.

Definition (Queuing Model)

A queuing system can be completely described by

Symbolic Representation of a Queueing Model (Kendall Notation)

David George Kendall 1918-2007

Following D.G. Kendall, a queueing model is specified and represented

Operating characteristic of a Queueing System

General Performance Measures/ Symbols of Queueing Systems

Number of customers in system n (both waiting and in service)

Operating characteristic of a Queueing System

Average number of customers in the system E(Ns ) (Average number of

You might also like