Scribd
Upload
27 views2 pages

CDA6350 Project 4

The document describes a discrete event simulation of two queues with arrival rates and exponentially distributed service times. Customers arrive at the queues and are served if there is space, otherwise they are dropped. Every few customers are returned to their original queues. The simulation runs for 10,000 customers to calculate probabilities of queue sizes, dropped customers, and average response time.

Uploaded by

Karthik Balasubramanian
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views2 pages

CDA6350 Project 4

The document describes a discrete event simulation of two queues with arrival rates and exponentially distributed service times. Customers arrive at the queues and are served if there is space, otherwise they are dropped. Every few customers are returned to their original queues. The simulation runs for 10,000 customers to calculate probabilities of queue sizes, dropped customers, and average response time.

Uploaded by

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

Project 4 Discrete Event Simulation

Discrete Event Simulation refers to the operation of any system as a discrete sequence of events.
A Poisson process is one such example where discrete event simulation is extensively applied.

Given in the question


-

Two queues along with the arrival rate and service time which is exponentially
distributed.

Solution:
-

A queue is defined with each queue having an arrival rate and service time
Customers arriving at the queue are sent in if the queue size is lesser than 9 which
indicates that the queue is not full
In case the queue size is full, the customer are dropped.
Every one customer among two from the first queue and one customer among four
customers in the second queue is returned back to the queue.
Service time is calculated and based upon that we calculate the values of response time
by finding the difference between the time when a customer enters the queue and the time
he finishes.
Average response time is calculated by dividing the response time for 10,000 customers.

1. The queue is checked for different instances where the queue does not have any
customer. Only in the first instance it is zero as it is initialized. But during the remaining
periods of time, the queue always has a customer and so the value stays as 0.
Prob( Zero customer) = 0
The queue is checked for 10,000 simulation runs as to how many times it has two
customers in the queue. It turns out that for four times the queue has two customers.
When the probability is calculated, it turns out to be 0.0004
Prob(Two customers) = 0.0004
The number of customers who dropped out were due to the system being full. So the
probability of the queue having nine customers is
Prob(Nine Customers) = 0.3375

2. During the entire simulation process, how many customers have been dropped from the
system because of the limited queue sizes of the two servers?
A total of 3375 customers have been dropped down because of the queue getting full in
size.

3. The response time is calculated every time a packet is accepted and enters into the queue.
Average response time of the overall system = 0.7810

You might also like