Telecommunication switching

systems
P.kiran Kumar ASST.PROF
NARSIMHA REDDY ENGINEERING COLLEGE
DEPT. OF ECE

Unit III
SWITCHING NETWORKS
SINGLE STAGE NETWORKS:
A network containing a cross-point
matrix with M-inlets and N-outlets is called
as Single stage network.
The cross points may be contacts of
crossbar switch or electronic devices .

Single stage network

Research and development has made it to use

photonic switches in networks containing
electronic devices.
These switches are used to inter link opticalfibre trunks in the network.

Symbols of electromechanical switch

The circle represents the switch side related
with control mechanism

Single stage network

Inefficiency of Single stage network:

The num of links that can be made in
cross point matrix in fig(i), is either
M(when M<N) or N(N<M)
If M=N, then the num of cross points
is given as c=N2
Hence, the cost of a switch rises with
increase in its size. In also falls
inversely with N.
Therefore, single stage networks are
very costly and are not used when
large num of inlets and outlets exists.

Gradings-Principal :
The technique of interconnecting the multiples
of switches in order to reduce the num of
trunks in a route is known as Gradings
For a route switch it is not necessary for each
incoming to have access to every outgoing
trunk. In order to provide required grade of
service, it is sufficient if each incoming trunk is
connected to outgoing trunk which is referred
as Limited Availability.
Availability is defined as the num of
outgoing trunks to which an incoming trunk is
Linked.

FIG(i):Represents accepted diagram of

Grading

Here 8 trunks are interconnected to two groups

of switches of availability.

Fig(ii) Shows the Grading of 8 trunks

Fig(ii): 8 Trunks Grading

Diagram

In this technique, traffic is handled by both

the groups and required of service is the
provided.
Grading allows one switching system to
access number of trunks more than the
availability of the switches in a certain limit.

Design of Progressive Gradings:

Design of Progressive grading depends on the
following
1.
Determining the number of graded groups g.
2.
Deciding how to interconnect the incoming trunk
with outgoing trunks of a grading.
Determining the number of graded groups g :
The switches connected to outgoing path are
multiplied to form a number of different groups
called as Graded Groups.
There are Three Methods of Grading:
(i) All the groups have access to individual trunks.
(Fig.i)
(ii) All
the
trunks
of
different
groups
are
interconnected to each other.(Fig.ii)
(iii) Combination of Method I and II. (Fig.iii)

Design of Progressive Gradings

Method I: All the groups have access to

individual trunks.

.. The num of outgoing trunks(N) is given as

N=gK
where,

g = Num of groups in a graded groups

K = Availability of switches.

Design of Progressive Gradings

Method II: All the trunks of different

groups are interconnected to each other.

Where all the trunks are interconnected

and
the num of outgoing trunks is given as
N=K.

Design of Progressive Gradings

Method III : Combination of Method I and II.

i.e., here, all the groups are interconnected with each
other but only through few common trunks as shown in
below figure.

..

The num trunks is given as

N= g K as K<N<gK
.. g = 2N/K
As grading is Symmetrical, the
value of g must be always
even.

Method III is preferred over other two methods as it

reduces the num of trunks and access trafc more
efciently during congestion.

Design of Progressive Gradings

Deciding how to interconnect the

incoming
trunk with outgoing trunks of a grading :
When the num of groups are two, then there
is only one way to interconnect the incoming
trunks(gK) with outgoing trunks(N).

But, when the grading contains more than two

groups which has highest trafc capacity is
chosen to interconnect incoming trunks(gK)
with outgoing trunks(N).

As the trafc is almost same on adjacent

outlets, so they are connected to common
having same sizes.

Design of Progressive Gradings

As a result, the trafc must progress

smoothly from
a) Individual to partial commons.
b) Smaller partial commons to larger.
c) Partial commons to full commons.

Fig(iv). Suitable progressive design to

accommodate more than 10 trunks.
.. The fig(iv) shows the desirable choice
for the design of progressive grading.

Gradings

Two forms of Gradings:

* SKIPPED GRADING.
* HOMOGENEUS GRADINGS.
SKIPPED GRADING:
Skipped grading increases the overall efciency of
a system by Non-adjacent groups in addition to
adjacent groups.

In Skipped Grading, Principle of grading is

applied to
complete system instead of applying to only some
parts.

Two forms of Gradings:

HOMOGENEUS GRADINGS:
In homogeneous grading each
between equal number of groups.

trunk

is

shared

Efciency of a system decreases when switches of

progressive grading chooses outlets randomly or
when they do not hunt from a fixed home position.
Homogeneous grading overcomes this problem by
using sequential grading instead of random selection.
As a result, Late-Choice trunks which are used only
during peak situations in Progressive gradings are
now no longer left free but are utilized completely.

Traffic intensity of gradings:

The capacity of a grading system to
carry the offered trafc load is referred as Trafc
Capacity of gradings.
In ideal grading interconnections among trunks are made
such that each outgoing trunk carries an equal amount of
trafc load.
Hence , for N trunks carrying a total trafc of A erlangs,
the occupancy of each trunk is given as A/N.

If K is the availability of trunks, then probability of all K

trunks being busy is given as B=(A/N)k.

The num of trunks required to carry trafc load of A

Erlangs having grade of service B is given as
N=(AB)-1/K

(1)

Traffic intensity of gradings:

Equation (1) gives linear relationship b/w the trafc load

and num of trunks is known as Erlangs ideal grading
formula.
In practical grading do not satisfy Erlangs ideal grading
conditions, but a linear relationship exists b/w trafc
capacity A and num of trunks for a given grade of service
B.
where,
Ak = The trafc carried by a Fullavailability group of k trunks.

B = Grade of service.
N = Num of required trunks.
K = Availability.

Using Erlang-full availability theory an approximated curve

of A against N when N t can be derived which
extended to straight line when N K as shown in above
figure, the straight line when NK is given as
A=Ak + (N-K)B1/k

Applications of Gradings
1.

Gradings are widely used in step-bystep systems.(Ex, Strowger system,

the cross-connections is done by TDF
in the form of Grading)

2.

The principle of gradings is used in

Automotive Alternative Routing(AAR)
to avoid Trafc Congestion.

3.

Grading is also used in Link Systems.

Link systems:
A general link system contains
multiple stages of primary and
secondary switches, with large
number of possible links between
all the stages.
The most commonly used link
systems are:
Two stage network.
Three stage network.
Four stage network.

Two stage network:

A two stage network with N

incoming and N outgoing trunks.

It has two interconnected stages of

primary and secondary switches.

Two stage network:

The primary switches consists of n inlets and

secondary switches consists of n outlets.
.. The num of primary switches(P) = Num of
secondary switches = Num of outlets per
primary switch = Num of inlets per secondary
switch.
where, P =N/n
The num of cross points per primary switch =
Num of cross points per secondary switch.
= Pn = N
The total num of cross points (C) the network =
(num of switches)x (cross point per switch)
i.e., C = 2 PN = 2N2
(1)
n

Two stage network:

From fig. It is clear that each primary switch is connected to each
secondary switch through a link.
.. Num of links = Product of primary and secondary switch.
= (Num of primary switches ) x (Num of
secondary switches)
= P2
.. Num of links = (N/n)2------- >(2)
Hence, the num of cross points is inversely proportional to 1/n and
the num of links inversely proportional to 1/n2. If n is increased
then num of cross points required in the n/w will decrease.
Thereby reducing the num of links required to carry the trafc.
Let the num of links be equal to num of incoming & outgoing
trunks. Then P2 = N--------- > (3)
Substituting equ (3) in (2) , we get n=N.
.. The total num of cross points C = 2N 3/2--------------- >(4)

Three stage network:

A three stage n/w consists of three stage
with primary, secondary and tertiary
switches.

In this n/w, there is one link from each

primary switch to each secondary switch.
Similarly a link from each secondary switch
to each tertiary switch.

Three stage network:

Thus, a given inlet on a primary

switch can be connected to a
desired outlet on a tertiary switch
through a secondary switch.
The three stage n/w has N incoming
trunks and N outgoing trunks with
n inlets and outlets for primary
and tertiary switches respectively.
.. The num of primary switches(P1)=
Num of tertiary switches, P3=N/n.
Thus, secondary switches have N/n
inlets and N/n outlets.

Three stage network:

If the num of links b/w primary and secondary

switches(A-link) are equal to the num of links
b/w secondary and tertiary switches(B-link) i.e.,
N,
Then the num of secondary switches are given as
P2= [N/(N/n)] = n
P2=Num of outlets per primary switch = Num
of inlets
per tertiary switch.
.. Num of cross points in primary stage
=n2(N/n)=nN
Num of cross points in secondary stage =
=n(N/n2)=N2/n
Num of cross points in tertiary stage = n2(N/n) =
nN