Scribd
Upload
9 views3 pages

QTDN

The document discusses the Erlang B and C models for calculating blocking and delay probabilities in telecommunications systems, along with Monte Carlo simulation for validation. It also presents a problem involving the calculation of blocking probability for an M/M/200/200 queue, concluding that a minimum of 201 circuits is required to meet a blocking probability of less than or equal to 0.01. The results show that the blocking probability for 200 circuits is approximately 0.01032, while for 201 circuits it is approximately 0.00916.

Uploaded by

krishn05082002
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
9 views3 pages

QTDN

The document discusses the Erlang B and C models for calculating blocking and delay probabilities in telecommunications systems, along with Monte Carlo simulation for validation. It also presents a problem involving the calculation of blocking probability for an M/M/200/200 queue, concluding that a minimum of 201 circuits is required to meet a blocking probability of less than or equal to 0.01. The results show that the blocking probability for 200 circuits is approximately 0.01032, while for 201 circuits it is approximately 0.00916.

Uploaded by

krishn05082002
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/ 3

QTDN Assignment

2021-IMT-055 (KRISHAN KUMAR)


November 2024

Q.1) Plot both analytical and simulation results


for both Erlang B and C models.
Ans: Erlang B Model
The Erlang B model calculates the blocking probability in a telecommunica-
tion system (e.g., call center, communication network) where a fixed number
of servers (or channels) handle incoming traffic. Calls that cannot be served
immediately are blocked (not queued).

Blocking Probability
The blocking probability is the probability that a new call will be blocked be-
cause all servers are busy. The formula is:
AC
B(A, C) = PCC! Ak
k=0 k!

where:

• A is the traffic intensity in Erlangs.


• C is the number of servers (channels).

Interpretation
• The numerator represents the probability that all C servers are busy.
• The denominator normalizes over all possible states (from 0 to C busy
servers).

Erlang C Model
The Erlang C model calculates the waiting (delay) probability in a system where
calls are queued if all servers are busy.

1
Delay Probability
The probability that a call will be delayed is given by:
AC C
C! ·C−A
C(A, C) = PC−1 Ak C
k=0 k! + AC! · C
C−A

where:
• A is the traffic intensity in Erlangs.

• C is the number of servers (channels).

Interpretation
• Calls are not blocked but queued if all servers are busy.
• If A ≥ C, the system is unstable, leading to frequent delays.

Monte Carlo Simulation


Monte Carlo simulation is used to validate the results of Erlang B and C models
through random sampling. It simulates:
• Call arrivals (Poisson distribution).

• Blocking probability (Erlang B).


• Delay probability (Erlang C).
The results demonstrate that simulated probabilities closely match the ana-
lytical results when the number of trials is large.

Q.2) Blocking Probability for M/M/200/200 Queue


Problem Description
An employee, Ram, calculated the blocking probability for a switching system
modeled as M/M/196/196 with an offered load of A = 180. The blocking
probability was found to be approximately 0.016. The task is to:

1. Calculate the blocking probability for M/M/200/200.


2. Find the minimum number of circuits k required to ensure the blocking
probability Pm ≤ 0.01.

2
Solution
The blocking probability in an M/M/k/k system is given by:
Ak
k!
Pm = Pk An
n=0 n!

where:
• A = 180 (offered load in Erlangs).
• k is the number of servers (circuits).

Step 1: Known Result


For k = 196, the blocking probability is given as:

P196 = 0.016

Step 2: Calculate for k = 200


For k = 200:
180200
P200 = P200200!180m
m=0 m!
The calculated blocking probability is:

P200 ≈ 0.01032

Step 3: Find Minimum k


To meet the requirement Pm ≤ 0.01, compute for k = 201:
180201
P201 = P201201!180m
m=0 m!

The calculated blocking probability is:

P201 ≈ 0.00916

Conclusion
• For k = 200, P200 = 0.01032, which exceeds the 1% requirement.
• For k = 201, P201 = 0.00916, which meets the requirement.
• Minimum number of circuits required: k = 201.

You might also like