0% found this document useful (0 votes)
879 views20 pages

Chapter Four: Two Dimensional Digital Switching

This document discusses two-dimensional digital switching, which combines space-division and time-division switching technologies. It describes time-space (TS) switching, where a time switch is followed by a space switch. The blocking probability of a TS switch is calculated. It also discusses multiple-stage time and space switches like space-time-space (STS) and time-space-time (TST) to reduce complexity. The blocking probability and implementation capacity of an STS switch are provided.
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
0% found this document useful (0 votes)
879 views20 pages

Chapter Four: Two Dimensional Digital Switching

This document discusses two-dimensional digital switching, which combines space-division and time-division switching technologies. It describes time-space (TS) switching, where a time switch is followed by a space switch. The blocking probability of a TS switch is calculated. It also discusses multiple-stage time and space switches like space-time-space (STS) and time-space-time (TST) to reduce complexity. The blocking probability and implementation capacity of an STS switch are provided.
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/ 20

TWO DIMENSIONAL DIGITAL SWITCHING

CHAPTER FOUR

TWO DIMENSIONAL DIGITAL SWITCHING


D. Tsega

May 24, 2019

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Outline

TWO DIMENSIONAL DIGITAL SWITCHING


Need for Two-Dimensional Switching:

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Need for Two-Dimensional Switching:


I The advantage of space-division switching is that it is
instantaneous.
I Its disadvantage is the number of cross points required to
make space-division switching acceptable in terms of blocking.
I The advantage of time-division switching is that it needs no
cross points.
I Its disadvantage, in the case of TSI, processing each
connection creates delays. Each time slot must be stored by
the RAM, then retrieved and passed on.
I In a third option, we combine space-division and time-division
technologies to take advantage of the best of both.
I Combining the two results in switches that are optimized both
physically (the number of cross points) and temporally (the
amount of delay).
SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Need for Two-Dimensional Switching:


I The space switching and time switching may be accomplished
in many ways.
I A two stage combination switch may be organised with time
switch as first stage and the space switch as the second stage
or vice versa.
I The resulting configuations are referred as time space (TS)or
space time (ST) switches respectively.
I Three stage time and space combinations of TST and STS
configurations are more pupular and flexible.
I Very large division switches includes many combinations of
time and space switches. Typical configurations are TSST,
TSSSST, and TSTSTSTS.
I These switches support 40000 lines or more economically.
SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:


I The general block diagram involving time and space switching

I The main task of the switching part is to interconnect an


incoming time slot and an outgoing time slot.
I The unit responsible for this function is group switch.
I There are two types of building block in the digital group
switch.
I They are time switch and space switch.
SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:


I Let the communication is to take place between subscriber A
and B.
I Let A is assigned time slot 3 and line 7 and subscriber B is
assigned time slot 1 and line 11.
I Then the signal moved from time slot 3 to time slot 1 by the
time-slot exchanger and is transfered from line 7 to line 11 in
the space array.
I Similarly, the signal originated by B is moved from slot 1 to
slot 3 through line 11 to 7.
I Let each time slot interchanger have T slots. If the space array
is a N × N, then the simultaneous connections possible is NT.
I If T = 128 and N = 16, 2048 connections can be supported.

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:


I This structure is not free of blocking.
Blocking probability:
I The blocking probability of TS switching is calculated as
follows.
I The probability that a subscriber A is active
ρ
=
T
I where ρ = fraction of time that a particular link is busy
measured in Erlangs, T = number of time slots in a frame.
I The probability that any other subscriber is active on the same
link
(T − 1)ρ
=
T

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:


Blocking probability:
I The probability that a particular called subscriber is chosen by
A
1 1
=
NT T
I where N = Number of inlets (or outlets) for N × N space
array. NT = Simultaneous connection
I The probability that the same time slot on a different outlet is
chosen by the other subscribers on the same inlet

(T − 1)(N − 1)ρ
=
T (NT − 1)

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:

Blocking probability:
I From Blocking probability

(T − 1)(N − 1)
  
ρ
B=
T × NT T (NT − 1)
I Mostly T >> 1 N >> 1 NT >> 1
ρ
B=
NT 3

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:


Implementaion complexity
I To take this into account the cost of memory bit is assumed
one hundredth of the cost of cross point.
NB
Implementationcomplexity = Nx +
100
I where NX = Number of space stage cross points, NB =
Number of bits of memory.
I The NB not only includes the time stage memory arrays, but
also the control memory(store) of the time stage and space
stage.
I Thus, NB = NBX + NBT where

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:

Implementaion complexity
I NBX = Number of memory bits for the space stage control
store= N×(Number of control words) (number of bits per
control word)
I NBT = Number of memory bits in the time stage equal to sum
of time slot interchange and the control store bits.
I = N× number of channels × number of bits per channel + N
× number of control words × number of bits per control world.

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Time-space (TS) Switching:

Example
I If N = 80, NBX = 13,440 and NBT = 24,960 for a typical TS
switch, calculate the implementation complexity.

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Multiple-Stage Time and Space Switching

I There are practical limits as to how many channels can be


multiplexed into a common TDM link for time stage switching
I When these limits are reached, complexity can be further
reduced only by using multiple stages
I Separating the space stages by a time stage
Time stage between two space stages
Space-Time-Space (STS) switch
I Separating the time stages by a space stage
Space stage between two time stages
Time-Space-Time (TST) switch

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Space-Time-Space(STS)Switch
I Each of the space switches is assumed to be a single stage
(nonblocking) Switch.
I For large switches, space switches are implemented with
multiple stages.

I When each individual stage (S, T, S) is nonblocking, the


operation is functionally equivalent to the operation of a three
stage space switch.
SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Space-Time-Space(STS)Switch
blocking Probability
I The STS switch is identical to the probability graph of three
"  #k
p 2

B = 1− 1−
β

Implementation capacity (IC)

2KC logN C
2 +KC (8) + KC log2
IC = 2NK +
100
where K = The minimum number of centre stage TSM to provide
desired grade of service, C = number of channel.
SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

TST SWITCHING

blocking Probability
I Is minimized if the number of space stage time slot L is made
to be large.
I Space switches the TST switch is strictly non blocking
L = 2T − L

I T is number of time slot of time switch


I L is number of space slot of space switch
SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

Space-Time-Space(STS)Switch

blocking Probability
"   2 #2
T
B = 1− 1−ρ
2

Implementation capacity (IC)

2NL logN T
2 +2NT (8) + 2NL log2
IC = N 2 +
100

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

STS and TST Comparisons

I TST architecture is more complex than the STS architecture


I Time expansion can be achieved at less cost than space
expansion
I TST switch becomes more cost effective than an STS switch
for high channel utilization
I STS has relatively simpler control requirements: Small switch

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

SWITCHING
TWO DIMENSIONAL DIGITAL SWITCHING

Need for Two-Dimensional Switching:

SWITCHING

You might also like