Topic 7

Introduction to Network
Engineering: Erlang model

UET-VNU Hà nội Faculty of Elec.& 1

Communications
 Some concepts
• The ability to simultaneously respond to
multiple users of network depends on the
number of servers. They can be:
– Number of lanes in a large road
– Number of seats on a bus
– Number of trunks on telephone system
– Number of wireless channel on mobile system
– The size of the circuited switching

UET-VNU Hà nội Faculty of Elec.& 2

Communications
 Some concepts
• Each user's request will occupy a server for an interval
time. Its called personal traffic. The total traffic of all
users request in the network is called the offered traffic
• If the offered traffic is large, the number of servers is
small leading to waiting or not being served of users
• The probability of waiting or not being served is called
the grade of service
• Question: How to design a system (determine the
number of servers) optimized with the offered traffic and
grade of service that are given.

-VNU Hà nội Faculty of Elec.& 3

Communications
 Traffic intensity
• Product of calling rate and holding time is traffic of a call
(measure by Erlang)

• Example: C=3 time/hour, T=10 minute/call

Traffic Au =3.10 minute/60minute=0.5 Erlang
• Concept: Carried traffic, offered traffic, lost calls.
• A call is lost because it meet congestion or blockage at
switch.
• Traffic intensity is system traffic per unit of time To design
a telephone exchange, have to know the traffic intensity of
busy time.
UET-VNU Hà nội Faculty of Elec.& 4
Communications
 Traffic intensity varies with the
time in day

UET-VNU Hà nội Faculty of Elec.& 5

Communications
 Grade of Service (GOS)

• Three quantities: offered traffic, number of

servers (trunks in telephone) and the probability
of loss call are related to particular formulas
• These formulas depend on how do process the
lost calls
• Design system based on these formulas

UET-VNU Hà nội Faculty of Elec.& 6

Communications
• Three kind of handling of a exchange for the loss call:
– Lost calls held (LCH, immediately redial, North
America) → Poisson traffic model
– Lost calls cleared (LCC, hang up and wait some time
interval before redial, redial is new call, Europe)
→ Erlang B traffic model
– Lost calls delayed (LCD, put the loss call in queue)
→ Erlang C queue model

UET-VNU Hà nội Faculty of Elec.& 7

Communications
 Poisson traffic model
• The Poisson formula is used to predict the probability that a call will be
blocked (North America) with assumption
– There are an infinite number of sources;
– Calls are served in random order;
– Blocked calls are held (protocol :wait for connection); and
– Holding times are exponentially distributed or constant.

• where:
     P=Poisson loss probability
     N=Number of trunks
     A=Traffic offered in Erlang
Formula concern to Poisson distribution (called Poisson traffic model)
UET-VNU Hà nội Faculty of Elec.& 8
Communications
 Table of Poisson model

UET-VNU Hà nội Faculty of Elec.& 9

Communications
PABX (private automatic branch
exchange)
• Example 1
• Design a remote PABX connected by a tie-line
that will be used for all inbound calls to that
PABX which will have 775 active ends. Known
30mEr of inbound traffic per active end, and
GOS should be better than 0.001.
How many trunks do need in the tie line route?
• Answer: to carry 23.25E (775*0.03), Need 40
trunks, and the actual grade of service should be
0.001.

UET-VNU Hà nội Faculty of Elec.& 10

Communications
• Example 2
• A Service need less than 5% of customer
calls will get a busy signal.
• But there are 2 x E1 trunk route (60
channels) on call centre carrying 51.806E. 
Should the incoming route be sufficient to
meet that Service
• Answer: No, busy rate should be about
14.3%.
UET-VNU Hà nội Faculty of Elec.& 11
Communications
 Erlang B traffic model
• The Erlang B formula is used to predict the probability that a call will
be blocked (or lost call)
– There are an infinite number of sources;
– Calls arrive at random;
– Calls are served in order of arrival;
– Blocked calls are lost (or cleared , need redial next time); and
– Holding times are exponentially distributed.

• where:
     B=Erlang B loss probability
     N=Number of trunks in full availability group
     A=Traffic offered to group in Erlang
Formula concern to Erlang distribution
UET-VNU Hà nội Faculty of Elec.& 12
Communications
UET-VNU Hà nội Faculty of Elec.& 13
Communications
• Example 1
• Design a remote PABX connected by a tieline
that will be used for all inbound calls to that
PABX which will have 780 active ends. Known
30mEr of inbound traffic per active end, and
GOS should be better than 0.001.
How many trunks do I need in the tie line route?
• Answer: to carry 23.4Er (780*0.03), I need 39
trunks, and the actual grade of service should be
0.001.

UET-VNU Hà nội Faculty of Elec.& 14

Communications
• Example 2
• A Service need less than 5% of customer calls
will get a busy signal.
But there are 2 x E1 trunk route (60 channels) on
my call centre carrying 51.806Er. 
Should the incoming route be sufficient to meet
my Service Level Objective.
• Answer: Yes, busy rate should be about 3.1%.

UET-VNU Hà nội Faculty of Elec.& 15

Communications
 Erlang C queue model
• The Erlang C formula is used to predict the probability that a call will be
delayed (block and wait in queue), and can be used to predict the
probability that a call will be delayed more than a certain time.(FIFO
system)
– There are an infinite number of sources;
– Calls arrive at random;
– Calls are served in order of arrival;
– Blocked calls are delayed; and
– Holding times are exponentially distributed.

• where:
     Pr(>0)=Probability of delay greater than zero
     C=Number of servers in full availability group
     A=Traffic offered to group in Erlangs
• UET-VNUH=HàAverage
nội
Holding timeFaculty
for a ofcall
Elec.& 16
Communications
UET-VNU Hà nội Faculty of Elec.& 17
Communications
UET-VNU Hà nội Faculty of Elec.& 18
Communications
 Erlan C

UET-VNU Hà nội Faculty of Elec.& 19

Communications
 Revision
• What is traffic intensity
• What is Grade of service
• How to design the size of circuit switching
• What are different between traffic model
of poison, erlang B,C

UET-VNU Hà nội Faculty of Elec.& 20

Communications
 WHAT ARE DATA PROTOCOLS?

• In the IEEE dictionary (Ref. 1), one

definition of a protocol is: “a set of rules
that govern functional units to achieve
communication.”
• A data network is a big investment, and
our desire is to get the best return on that
investment. One way to optimize return on
a data network is by the selection of
operational protocols.

UET-VNU Hà nội Faculty of Elec.& 21

Communications
 Reference model OSI (Open System
Interconnect) in communications

UET- VNU Hanoi Faculty of Elec. & Telecom. 22

 Functions of layers
• End-Users
• Encryption to security (letter)
• The control structure of dialogue
– How do conduct com. session
• End-to-end control of packets
– How do acknowledge
• Routing of packets in network
– How to go to destination
• Error control
– How do control error
• Transmission of raw bits of data
– How do transfer

UET- VNU Hanoi Faculty of Elec. & Telecom. 23

 Example for 7 of layers

UET- VNU Hanoi Faculty of Elec. & Telecom. 24

 Basic Protocol Functions for packet
switching
• Segmentation and reassembly (SAR);
• Encapsulation;
• Connection control;
• Ordered delivery;
• Flow control; and
• Error control.

UET-VNU Hà nội Faculty of Elec.& 25

Communications
• Segmentation refers to breaking up the
data message or file into blocks, packets,
or frames with some bounded size
• Reassembly is the reverse of
segmentation, because it involves putting
the blocks, frames, or packets back into
their original order.

UET-VNU Hà nội Faculty of Elec.& 26

Communications
• Encapsulation is the adding of header and
control information in front of the text or info field
and parity information, which is generally carried
behind the text or info fields.
• Connection control. There are three stages of
connection control
1. Connection establishment;
2. Data transfer; and
3. Connection termination.
UET-VNU Hà nội Faculty of Elec.& 27
Communications
• Ordered delivery: Packets, frames, or blocks are
often assigned sequence numbers to ensure
ordered delivery of the data at the destination
• Flow control: Flow control refers to the
management of the data flow from source to
destination such that buffer memories do not
overflow but maintain full capacity of all facility
components involved in the data transfer.
• Error control: Error control is a technique that
permits recovery of lost or error packets (frames,
blocks).
UET-VNU Hà nội Faculty of Elec.& 28
Communications
 Summary
• In Network there are circuited switching and packet
switching. The packet switching need a buffer in
addition
• A size of circuited switching (number of trunks) based
on Erlang formula, which relating to offered traffic and
grade of service. The local switch have to be a non-
blocking switch in local area.
• Multi access (share system) to exchange depend on
on the method of handling lost calls. There are three
handlings concerning to Erlang formulas
• Multiplexing (share a link) can carried out in the time
domain. There is the switch mixing time and space.
• Need protocols for two target: Ensure communication
and optimize to use network
UET-VNU Hà nội Faculty of Elec.& 29
Communications
 Summary
• In Network there are circuited switching and packet
switching. The packet switching need a buffer in
addition
• A size of circuited switching (number of trunks) based
on Erlang formula, which relating to offered traffic and
grade of service. The local switch have to be a non-
blocking switch in local area.
• Multi access (share system) to exchange depend on
on the method of handling lost calls. There are three
handlings concerning to Erlang formulas
• Multiplexing (share a link) can carried out in the time
domain. There is the switch mixing time and space.
• Need protocols for two target: Ensure communication
and optimize network to use
UET-VNU Hà nội Faculty of Elec.& 30
Communications