0 1

Traffic Engineering & Network Design

Introduction to Teletraffic Engineering

Introduction to Teletraffic Engineering

Concepts and Methodologies
0 1 Presentation Outline
Traffic Engineering & Network Design

(Administrative Details
(Defining Teletraffic Engineering
(Basic components of teletraffic engineering
strategies and their value to different clients.
(Traffic concepts – revision
n Bids, seizures
n Definition of traffic

Lecture 01/2
0 1 Objectives
Traffic Engineering & Network Design

(To be able to describe the relevance and the

importance of teletraffic engineering.
(To be able to apply some basic probability theory
that is required for the mathematical modelling of
teletraffic engineering problems.

Lecture 01/3
0 1 Administrative Details - 1
Traffic Engineering & Network Design

(Lectures
n Joint U/Grad and P/Grad
n 2 hours per week. (No lecture on Monday 11th March 2002)
(Laboratories
n Separate sessions with common material
n No labs in Week 1
n No reports are required for the lab sessions
n Practical examination on software use – Week 10?
n Software can be downloaded for personal use.
(Website
n http://www.catt.rmit.edu.au/teletraffic
n Account: teletraffic; Password: rmit897
(Contact details
n Email: richard@catt.rmit.edu.au
n Telephone: 9925 3697

Lecture 01/4
0 1 Administrative Details - 2
Traffic Engineering & Network Design

(Masters Students
n Assignments x 4 = 10%
n Practical Exam = 25%
n Major Project = 15%
n Final Examination = 50%
(Undergraduate students
n Assignments x 4 = 10%
n Practical Exam = 25%
n Minor project = 5%
n Final Examination = 60%

Lecture 01/5
 What is the role of
0 1
Teletraffic Engineering today?
Traffic Engineering & Network Design

(There are three main thrusts for

Teletraffic Engineering today:
nDesign (for development and manufacture)
nDimensioning (for planning and installation)
nOperations (network traffic management)

Lecture 01/6
0 1 Design
Traffic Engineering & Network Design

(Examples:
n A manufacturer designing a PABX system must be able to
demonstrate that it has the necessary capacity and
performance to meet customer needs.
n A manufacturer of a piece of switching equipment must also be
able to demonstrate to the telecommunications authority that
the system performs up to specification with respect to call
processing times, internal congestion standards, ITU-TSS
standards etc.
n The designer of a packet switching network must be able to
assess network delays, compute buffer sizes, etc.

Lecture 01/7
 The
The Planning
Planning and
and Installation
Installation Cycle
Cycle
of
of Telecommunications
Telecommunications Networks
Networks
Traffic
Traffic
Measurement
Measurement
Works
Traffic
TrafficData
Data
Programme
Processing
Processing

Equipment Traffic
Traffic
Installation Forecasting
Forecasting

Circuit
CircuitGroup
Group Trunking
Trunking
Dimensioning
Dimensioning Design
Design

Shadowed boxes indicate where Teletraffic

Engineering is involved.
0 1 List of Communications Traffic Concepts
Traffic Engineering & Network Design

(Bids and seizures

(Service time
(Traffic volume
(Traffic intensity
(Blocking
(Offered traffic
(Carried traffic
(Overflow traffic
(Lost traffic
(Congestion: Call and Time

Lecture 01/9
0 1 Some special relationships
Traffic Engineering & Network Design

The relationships between: • Bids and seizures

• Service time
• Traffic volume
• Traffic intensity

These concepts will be illustrated using the following

model: Group
Bids of
Resources

(All bids are assumed to be successful;

(All bids result in the seizure of a resource.
The group of resources (circuits) will now be observed
using two different techniques..... Lecture 01/10
0 1 Simulating Calls in a Network
Traffic Engineering & Network Design

(Let’s examine a simulation study of calls being

offered between two telephone exchanges:

Terminal Node-14

Lecture 01/11
 Individual Circuit Monitoring
4 mins 12 mins
1:
13 mins 2 mins
2:
4 mins 8 mins 8 mins
3:
12 mins 8 mins 4 mins
4:

0 15 30

Time in Minutes
Traffic Volume = Total of the service times
= 75 minutes = 1.25 erlang hours
Average Service time = Total of service times
Number of seizures
= 75 Minutes = 7.5 minutes
10
Traffic
Traffic Number
Numberofof x Average
Average
=
Volume
Volume Seizures
Seizures Service
ServiceTime
Time
0 1 Individual Circuit Monitoring
Traffic Engineering & Network Design

Circuit 1

1
0

1
0
1
3
1
6
1
9
2
2
2
5
2
8
Circuit 2

Plots of the 0
1

1
0
1
3
1
6
1
9
2
2
2
5
2
8
individual
circuit occupancies Circuit 3

0
1

1
0
1
3
1
6
1
9
2
2
2
5
2
8
Circuit 4

0
1

1
0
1
3
1
6
1
9
2
2
2
5
2
8
Lecture 01/13
 Spreadsheet View of a Group Occupancy
0 1
Measurement
Traffic Engineering & Network Design

Time: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 Total time

Circuit 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 16 Circuit 1
Circuit 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 15 Circuit 2
Circuit 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 20 Circuit 3
Circuit 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 24 Circuit 4
Occ. 3 3 4 4 3 3 2 2 2 2 2 3 2 1 2 2 2 2 3 2 2 3 2 2 3 3 3 4 3 1 75 Erlang Minutes

10 Seizures
GroupOccupancyMeasurement 7.5minutes

4 2.5Erlangs
Occupancy

3
2
1
0
1

11

13

15

17

19

21

23

25

27

29
Time

Lecture 01/14
 Group Occupancy
Circuit 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
Circuit 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
Occ. 3 3 4 4 3 3 2 2 2 2 2 3 2 1 2 2 2 2 3 2 2 3 2 2 3

Group Occupancy Measurement

6
Occupancy 4
2
0

Average = Traffic Volume

Traffic Intensity Period of Observation

= 75 minutes
30 minutes

= 2.5 erlangs
Note:

= Traffic Period of
Traffic Volume x
Intensity Observation
0 1 Two equations for Traffic Volume
Traffic Engineering & Network Design

Traffic Number of Average

= x
Volume Seizures Service Time
and

Traffic Period of
Traffic Volume = x
Intensity Observation

(Since we now have two equations for traffic volume

we may equate them to give the following fundamental
relationship:

AT = nh
Where A is the traffic intensity, T is the period of measurement, n is the number of
seizures and h is the service time. Lecture 01/16
0 1 Traffic Formula
Traffic Engineering & Network Design

We may rearrange the formula

AT = nh
n
to the following: A= h
T
(Now, the ratio n/T is the average rate of arrival of the
calls in this observation period. Let us define n/T = λ
(Then
A=λh
Thus,
Traffic
TrafficIntensity
Intensity
==
Mean
Meanarrival
arrivalrate
ratexxmean
mean"service"
"service"time
time
(Units of traffic are the "erlang".) Lecture 01/17
0 1 Vectors and Matrices - 1
Traffic Engineering & Network Design

1. What is a matrix ?
A matrix A is a rectangular array of numbers,
usually enclosed by a pair of brackets such as:
6 4 -1
2 3 7
-3 9 14
1 -5 17
7 22 -13
( A matrix can be used to represent a variety of
different physical situations. The most common
use involves representing systems of equations:
n 2x + 3y + 7z = 0
n x - 5y +17z = 0
n would be one way of representing a system of homogeneous
equations by the matrix given earlier.

Lecture 01/18
0 1 Vectors and Matrices - 2
Traffic Engineering & Network Design

( Alternative uses come from communications examples.

( The matrix given below could represent the traffic demand
between pairs of telephone exchanges given in hundreds of
calls per hour at the busiest time of the day:
10 5 3
4 15 2
3 7 21

Expressed in a general form, a matrix A can be written as:

a11 a12 … a1n
a22 a22 … a2n
am1 am2 … amn

m rows by n columns. (m x n) matrix.

Lecture 01/19
0 1 Communications Terminology
Traffic Engineering & Network Design

A Communications Network
A F
B E
C G
D
( Nodes are indicated by the circles.
( Links are shown connecting the nodes, they may be
unidirectional, bidirectional or undirected.
( A chain is a directed sequence of links connecting a pair
of nodes.

Lecture 01/20
0 1 The Communication Matrix
Traffic Engineering & Network Design

2 4
5
1
3
(We can represent the above communications network using
1's and 0's to indicate whether a direct path exists between
a given pair of nodes. The resulting matrix (given below) is
known as the connection matrix.
0 11 0 0
0 01 1 0
C=
0 00 1 1
0 00 0 1
0 0000
Lecture 01/21
 Properties of the
0 1
Communication Matrix
Traffic Engineering & Network Design

1. If the links between the nodes of the

network are bidirectional, then the matrix
will be symmetric.
2. The matrix can be used to determine many
different properties related to the topology
of a network.
n For example, if we add together the elements of a row,
we find that this total represents the total number of
outgoing links from the node represented by that row.
Similarly, by adding the numbers in the column we find
the number of incoming links to the node.

Lecture 01/22
0 1 Some Network Theory
Traffic Engineering & Network Design

(In communications systems, a network is formed

by the interconnection of exchanges with groups
of circuits (or transmission links) carrying
telecommunications traffic. The concepts of
network theory can be applied to this situation in
the following way
n The exchanges in the network can be regarded as nodes. These
nodes can perform three possible functions; they may act as
sources of traffic for the network, or they may act as the
terminating point for this traffic, i.e. they are sinks; finally, they
may act as transit points for this traffic.
n The groups of circuits which carry traffic between these
exchanges are referred to as links.
n The traffic carried on a link in a network is called the flow, or
more correctly, the link flow.

Lecture 01/23
0 1 Concepts of Flow
Traffic Engineering & Network Design

( In the previous slide we referred to link flows as being the

total traffic carried on a link. The notion of flow can be further
extended in a directional network to specify the traffic using
an ordered sequence of links (i.e. a chain), and this flow is
called a chain flow.

B 2 C
2+5
A 5
2
3 D
Chains Chain Flows
A-D 3 erlangs
A-B-D 5 erlangs
A-B-C-D 2 erlangs
Lecture 01/24
0 1 Link Chain Incidence Matrix
Traffic Engineering & Network Design

( The graphical procedure which we have just described can be

formalised using the notion of a link-chain incidence matrix.
This is defined for a given network as follows:
( Suppose that we list all the possible chains carrying traffic
between pairs of exchanges in a directed network and that we
number these chains in some sequence 1,2, …,n. We define an
element of the matrix C as follows:

1 if link i is on chain j
c ij = {
0 otherwise
Let vector f be the ordered list of link flows and h be the ordered
list of chain flows, then we may relate these quantities in the
following matrix equation:

Ch = f
Lecture 01/25
0 1 Example L-C Incidence Matrix
Traffic Engineering & Network Design

4
B D
1 8
5
A 3 7 F
2 9
C 6 E
(Chains:
n 1: {1, 4, 8} 4 erlangs
n 2: {2, 3, 5, 9} 3 erlangs
n 3: {2, 3, 4, 8} 7 erlangs
n 4: {1, 4, 7, 9} 9 erlangs
n 5: {1, 5, 9} 5 erlangs

Let us now construct the link-chain incidence matrix for this

network example. Lecture 01/26
0 1 6-node Network Example
Traffic Engineering & Network Design

Link-chain incidence matrix 1234 5

1 1001 1
2 0110 0
3 0110 0
4 1011 0
C= 5 0100 1
6 0000 0
7 0001 0
8 1010 0
9 0101 1
(How could we decide how many times a link
has been used by all the chains?
(How could we find out how many links made
up an individual chain? Lecture 01/27
0 1 Computing the link flows
Traffic Engineering & Network Design

If the chain flows are:

4
3
7
9
5

What are the link flows?

Lecture 01/28