9/25/2011

CIRCUIT SWITCHING TELETRAFFIC

Routing

9/25/2011

Routing
Concepts

A route is a path to particular destination An exchanges determines the call destination by analyzing the called number and then selects an outgoing trunk in a route to destination 2 types of destination

A final destination (FDEST) is a call is the local exchange that serves the called party An intermediate destination (IDEST) is an exchange where the call path enters another network, on its way to the destination

Digit analysis is the process that produces a FDEST and IDEST from called subscriber number (EC-LN), national number (AC-EC-LN), or international number (CC-AC-ECLN)

Routing
Concepts

In LATA exchanges, calls with subscriber and national numbers can have IDEST or FDEST destination Called with international called number always have an IDEST In IC exchanges, all calls have IDEST destinations In calls with national called number, IDEST is an exchange in the LATA network determined by combination of AC-EC For calls with international called numbers, the IDEST depends on whether the IC exchange is an ISC exchange

If the exchange is no an ISC, the call destination is an ISC in the IC network determined by the country code (CC) in the number At the ISC, the destination is an ISC in the country identified by CC

9/25/2011

Routing

Routing

Alternate routing is the procedure by which an exchange selects an outgoing trunk for a call when there are several routes to a destination In this procedure, the order in which the routes are listed specifies the sequences in which an exchange checks the outgoing trunk groups for available trunks. In alternate routing, the TG to destination are ordered:

The 1st choice route is the most direct one The 2nd choice is the most direct one among the remain routes

9/25/2011

Routing

Automatic rerouting (crankback) is a refinement of alternate routing

Automatic rerouting depends on ability of an exchange to signal the preceding exchange that is not able to extend the setup

Traffic Engineering
Objectives

To determine relationship between 3 components

Whats the quality of service experienced by a users in a given system with the given traffic load How the system has to be dimensioned in order to achieve a given QoS with given traffic How big can the traffic load be without deteriorating the QoS

9/25/2011

Traffic Engineering
Objectives

Traffic theory describes the dependencies between different factors by means of mathematical models

QoS Offered traffic The capacity of the system Distribution of the number of connections in progress Queue length distribution in a buffer

The quantities considered are often stochastic

Traffic Engineering
System and Traffic Models

Model are needed both for system and the traffic offered to it In the system model, the most central functionalities of the system are described by means of simple basic elements

Servers Queue Traffic process Base on measurement Aims at an economical, parsimonious description with as few parameters as possible

Traffic model describes behavior of the offered traffic

9/25/2011

Traffic Engineering
Traffic Models

Traffic Engineering
The use of Traffic Theory

Design of networks and its elements

Dimensioning Optimization Performance evaluation Efficient operation of the networks Traffic control Routing Charging

Control action

9/25/2011

Traffic Engineering
Concepts

Dimensioning determine the number of trunks required on a route or connection between exchanges

Calling rate the number of times a route or traffic path is used per unit period, or more properly defined the call intensity per traffic path during the busy hours Holding time the duration of occupancy of one or more paths per call, or sometimes the average call duration of occupancy of one or more paths per call Traffic path a channel, time slot, etc. Carried traffic the volume of traffic actually carried by a switch Offered traffic the volume of traffic offered to a switch

Traffic Engineering
Concepts

9/25/2011

Traffic Engineering
Concepts

Traffic Engineering
Concepts

9/25/2011

Traffic Engineering
Concepts

Traffic Engineering
Concepts

Preferred unit of traffic intensity is Erlang (Erl)

erlang is dimensionless unit One erlang represents a circuit occupied for 1 hour Consider a group of circuits, traffic intensity in erlang is number of call-seconds per second or number of call-hours per hour Example: a group of 10 circuits had a call intensity 5 erlangs 5 circuits is busy at the time of measurement

9/25/2011

Traffic Engineering
Concepts

Example

In a local switch, the number of calls in an hour is 1800 The mean holding time of a call is 3 minutes A = 1800 x 3 / 60 = 90 erlang

Traffic Engineering
Concepts

10

9/25/2011

Traffic Engineering
Concepts

Traffic Engineering
Traffic Modelling

11

9/25/2011

Traffic Engineering
Traffic Flow

Offered traffic, Ao

Traffic, which would be carried were there no constrain in the system A theory concept Traffic that is usually being carried Difference between the offered and carried traffic

Carried traffic, Ac

Blocked (lost) traffic, Al

Traffic Engineering
Concepts

Lost call / blocked calls Grade of service (GOS) or Quality of Service (QoS)

Expresses probability of meeting blockage during the BH Expressed by letter p Defined as probability of blockage in term of erlang formula

12

9/25/2011

Traffic Engineering
Concepts

GOS depends on number of factors

The distribution in time and duration of offered traffic (random or periodic arrival, constant or exponential holding time) Number of traffic sources (limited or infinite) The availability of trunks in a group to traffic sources (full or restricted availability) The manner in which lost calls are handled

Lost call clear (LCL) Lost call held (LCH) Lost call delayed (LCD)

13

9/25/2011

Traffic Engineering
Concepts Erlang B

Traffic Engineering
Concepts Erlang B

14

9/25/2011

Traffic Engineering
Concepts Erlang C

Traffic Engineering
Concepts Erlang C

15

9/25/2011

Traffic Engineering
Concepts

Traffic Engineering
Dimensioning

Efficiency

16

9/25/2011

Traffic Engineering
Overflow Traffic

The system consists of 2 parts

Primary system: m1 servers Secondary system: m2 servers

The arriving traffic is first offered to primary system If all servers of the primary system are occupied, the call is directed to the secondary group

The traffic directed from the primary group to the secondary group is called overflow traffic

If all servers of the secondary group are also occupied, the arriving calls is blocked

Traffic Engineering
Overflow Traffic

Alternate Route

17

9/25/2011

Traffic Engineering
Overflow Traffic

Traffic Engineering
Overflow Traffic

18

9/25/2011

Traffic Engineering
Blocking of Overflow Traffic

Traffic Engineering
Blocking of Overflow Traffic

19

9/25/2011

Traffic Engineering
Dimensioning Overflow Traffic

20