Scribd
Upload
109 views19 pages

Simulation of Queueing Systems

A single channel queueing system is described as having a calling population with random arrivals following a probability distribution, customers that receive service from a single server according to a random service time distribution, unlimited waiting capacity, and FIFO queueing discipline. The simulation of such a system tracks the state of the system over time as customers arrive and depart, with events being arrivals that change the number of customers or departures that allow the next customer to enter service. Key outputs of the simulation include the number of customers in the system and idle time of the server.

Uploaded by

Suresh Thangarajan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
109 views19 pages

Simulation of Queueing Systems

A single channel queueing system is described as having a calling population with random arrivals following a probability distribution, customers that receive service from a single server according to a random service time distribution, unlimited waiting capacity, and FIFO queueing discipline. The simulation of such a system tracks the state of the system over time as customers arrive and depart, with events being arrivals that change the number of customers or departures that allow the next customer to enter service. Key outputs of the simulation include the number of customers in the system and idle time of the server.

Uploaded by

Suresh Thangarajan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

SIMULATION OF QUEUEING SYSTEMS

Simulation of Queueing Systems


A queueing system is described by its

Calling population
Nature of arrivals
Service mechanism
System capacity
Queueing discipline

Single channel queue


In single channel queue,
The calling population is infinite; that is if a unit leaves the calling population
and joins the waiting line or enters service, there is no change in arrival rate of
other units that may need service.
Arrivals for service occur one at a time in a random fashion; once they join the
waiting line, they are eventually served.
Service times are of random length according to a probability distribution
which does not change over time.
The system capacity has no limit, meaning that any number of units can wait in
line.
Finally, the units are served in the order of their arrival (FIFO- First In First
Out) by a single server or channel.

Single channel queue (Contd.,)


In single channel queue,
Arrivals and services are defined by the distribution of the time between arrivals
and the distribution of service times, respectively.
For any simple single or multi-channel queue, the overall effective arrival rate
must be less than the total service rate, or the waiting line will grow without
bound. They are termed as explosive or unstable.
The state of the system is the number of units in the system and the status of the
server, busy or idle.
An event is a set of circumstances that cause an instantaneous change in the state
of the system.
The two possible events that can affect the state of the system are: entry of a unit
into the system (the arrival event) or the completion of service on a unit (the
departure event).
The queueing system includes server, the unit being served and the units in the
queue.
The simulation clock is used to track simulated time.

Single channel queue (Contd.,)


Service-just-completed flow diagram

Single channel queue (Contd.,)


Unit-entering-system flow diagram

Single channel queue (Contd.,)


Potential unit acts upon arrival

Server outcomes after service completion

Single channel queue (Contd.,)


Interarrival and Clock times

Single channel queue (Contd.,)


Service times

Single channel queue (Contd.,)


Simulation Table Emphasizing Clock Times

Single channel queue (Contd.,)


Chronological Ordering of Events

Single channel queue (Contd.,)


Number of customers in the system

Single channel queue (Contd.,)


A small grocery store has only one checkout counter.
Customers arrive at this checkout counter at random from 1 to
8 minutes apart. Each possible value of interarrival time has
the same probability of occurrence, as shown in table 1. The
service times vary from 1 to 6 minutes with the probabilities
shown in table 2. The problem is to analyze the system by
simulating the arrival and service of 20 customers.

Single channel queue (Contd.,)


Distribution of time between arrivals

Single channel queue (Contd.,)

A
Customer

B
Time
between
arrivals
(minutes)

C
Arrival time

F
Time
customer
waits in
Queue

G
H
Time service Time
ends
customer
spends in
system

D
Service time
(Minutes)

E
Time service
begins

I
Idle time of
server

Single channel queue (Contd.,)


Arrival time = cumulative of time between arrivals
Time service begins = Max (Arrival time of customer, (Service
time of previous customer + Time service begins of previous
customer))
Time customer waits in queue = Time service begins Arrival
time
Time service ends = Time service begins + Service time
Time customer spends in system = Time customer waits in
queue + Service time
Idle time of server = Time service begins for customer Time
service ends for previous customer

Single channel queue (Contd.,)

Single channel queue (Contd.,)

Single channel queue (Contd.,)


Expected service time (probability distribution is different)
E(S) Expected service time
s Service time
p(s) Probability distribution of service time

Expected time between arrivals (Probability distribution is same)


E(A) Expected time between arrivals
a lowest value of time between arrivals
b highest value of time between arrivals

You might also like