Documente Academic
Documente Profesional
Documente Cultură
N outlets
1
9 10
1
2
3
4
M inlets
5
6
7
8
9
10
Switching Networks
Single Stage Network
For example a switch with 100 inlets and 100 outlets
requires 10, 000 crosspoints and only 1% of these can be
used at any time.
For making connections between large number of trunks
are constructed as network containing several stages of
switches.
Switching Networks
Two Stage Network
g2
n
nxg
nxg
N
inlets
N
outlets
n
n
nxg
nxg
If the two stage network shown above has N incoming and N outgoing
trunks and contained primary switches having n inlets and secondary
switches having n outlets , then number of primary switches g = number of
secondary switches = number of outlets per primary switch = number of
inlets per secondary switch.
g = N/n
The No. of crosspoints per primary switch = No. of crosspoints per secondary
switch = g n = N
The total No. of crosspoints C2 in the network = No. of switches x crosspoints
per switch .
C2 = 2 g n = 2N/n
(1)
Since there is one link from each primary switch to each secondary switch ,
the No. of links is equal to No. of primary switch x No. of secondary switches
= g = (N/n )
(2)
The No. of crosspoints varies as 1/n and No. of links varies as 1/n , if n is
made large to reduce the No. of crosspoints . There will be few links to carry
traffic .
Let the No. of links be equal to No. of incoming and outgoing trunks then :
g2 = N ,substituting in equation (2)
N = N2/n2
n =N
(3)
n2 = N2/N
n
200
incoming
trunks
10x10
20 switches
n
20x20
200
outgoing
trunks
10 switches
n
10x10
Fig (a)
20x20
n
20x20
20x20
200
incoming
trunks
10 switches
10x10
10
10x10
x10
200
outgoing
trunks
20 switches
n
20x20
20x20
10x10
10x10
Fig (b)
Two possible networks are shown above , each containing 6000
trunks . The network of (a) suitable for 20 outgoing routes each
having 10 trunks and fig (b) is suitable for 10 outgoing routes
each having 20 trunks.
(5)
A Links
n
nxg2
g1 =N/n
Primary Switches
N
inlets
nxg2
N/n x N/n
g2 = Sec.
Switches
N/n x N/n
g2 x n
g3 = N/n Tertiary
switches
g2x n
n
N
outlets
There is one link from each primary switch to each secondary switch and
one link from each secondary switch to each tertiary switch
A connection from given inlet on primary switch to a selected outlet
tertiary switch may be made via secondary switch , unless its link to
primary or it link to secondary switch is busy .
If the three stage network has N incoming trunks and N outgoing trunks
and primary switch with n inlets and secondary switch with n outlets.
The No. of primary switches (g1) = No. of tertiary switches (g3) = N/n.
The primary switches have N/n inlets and outlets, if the No. of primary
secondary links (A links) and secondary tertiary links (B links ) are each
N , then No. of secondary switches is :
g2 = N N/n = n
No. of outlets per primary switch = No. of inlets per tertiary switch.
No. of crosspoints in primary stage = n N/n = Nn.
No. of crosspoints in secondary stage = n ( N/n) = N/ n.
No. of crosspoints in tertiary stage = n N/n = Nn.
The total No. of crosspoints are :
C3 = N(2n + N/n)
(1)
(3)
Multi-exchange
network
F
JI
G
C
H
I
Fig 3.1
A
Outlet
To Exchange
01
02
04
03
05
02
01
1.
2.
Control Path
Switching
Network
Line Unit
Register
Finder
Line unit
Called
Susb
Common control
system
Digit Receiver
and Storage
Register
Initial
Translator
Register
Sender
Charging
Circuit
Operation
Control
Final
Translator
Mtce.
Circuit
Event
Monitor
Event Monitoring
Event occurring outside the exchange at the line units ,trunks ,
junctors and inter exchange signaling sender/receiver units are all
monitoring by the control system.
Typical events include call request and call release signals at line
units.
The occurrence of events are signaled by operating relays which
initiate control action. The control subsystem may operates relays
in the junctors senders /receivers and line units and command
these units to perform certain functions.
Event monitoring may be distributed . The line unit may initiate
control action on occurrence of certain line events. When subs
goes off hook .the event is sensed , the calling location is
determined and dial tone is extended and register finder is
activated to find free register .
1.
2.
3.
4.
5.
6.
Fig (a)
Stored program
control
(a). Electromechanical
Switching system
(b). Electronics Switching
system
switching n/w
Stored program
control
Fig ( b )
Centralized SPC:
In centralized control , all the equipment replaced by single
processor which must be quite powerful.
It must be capable of processing 10 to 100 calls per second .
Depending on load of system and simultaneously performing
many other tasks.
A typical configuration of an ESS is shown in next slide using
centralized SPC .A centralized configuration may use more
than one processor for redundancy purposes.
Each processor have access to all exchange resources like
scanner and distribution points and is capable of executing all
control functions
From lines
Signal
Distributor
Scanners
Processor
Maintenance
console
Memory
Secondary storage:
Call recording,
program
storage etc
P2
Processor
Secondary
storage
Fig 4.4
P1
M1
P2
M2
Exchange Environment
P1
P2
ED
M1
M2
ED = Exclusion Device
Fig 4.6 Load sharing mode
Distributed SPC
In distributed control ,the control functions are distributed by
many processors within the exchange itself.
This structure offer better availability and reliability than
centralized SPC . Exchange control functions are decomposed
horizontally or vertically for distributed processing .
In vertical decomposition the exchange environment is divided
into several blocks and each block is assigned to a processor
that perform all control functions .related to that block of
equipment.
The total control system consist of several control units
coupled together. The processor in each block may be
duplicated for redundancy purposes and operated in one of
three operating modes.
In horizontal decomposition each processor perform only one
or some of exchange control functions. Typical horizontal
group is shown in figure 4.8.
Distributed SPC
Level 3
Event monitoring
and distribution
Level 2
Call
processing
Level 1
O & M and
charging
Real time
constraints
increases
Distributed SPC
A chain of different processors may used to perform the
event monitoring ,call processing and O & M functions .
Entire chain may be duplicated for redundancy purpose.
Lever 3 Processing
Since the processors perform specific functions in
distributed control .They can be specifically designed to
perform these functions.
In fig. 4.9 below level 3 processing handles scanning ,
distribution and marking functions.
The processors and associated devices are closed to
switching network, junction and signaling equipment.
Processing operations are simple , specialized and well
defined.
Processing at this level results in setting or sensing one or
more binary conditions in flip flop and registers
Distributed SPC
Exchange environment
EM & DP =
Event
monitoring and
distribution
processing .
O&M P =
Operation and
maintenance
processing
EM & DP
EM & DP
Level 3
Call
processing
Call
processing
Level 2
O&M and
charging
O&M and
charging
Level 1
Distributed SPC
Level 2 Processing
Level 2 employed for call processing . It is usually termed as
switching processor. The switching processor are not generally
different from general purpose computers.
Some specific characteristics to switching processors are designed
to ensure 99.9 % availability, fault tolerance and security of
operation.
In the input output area the switching processor differ from
general purpose computer mainly on account of telephone
peripherals such as scanners ,distributor and marker along with
conventional data .
Distributed SPC
The traffic handling capacity of the control equipment is
usually limited by capacity of switching processor . The
load on switching processor is measured by its occupancy t
by formula.
t=a+bN
a = Fixed overhead depending upon exchange capacity.
b = Average time to process one call
N = No. of calls per unit time.
Distributed SPC
Level 1 Processing :
Level 1 control handles O & M functions which involve
following steps .
Administer the exchange hardware and software.
Add, modify or delete information in translation table .
Change subscriber class of service.
Put a new line or trunk in service.
Supervise operation of exchange
Monitor traffic
Detect and locate fault and errors .
Run diagnostic and test program.
Man machine interaction.
Distributed SPC
Maintenance
personnel
Operator
O&M
Computer
Exchange 1
Exchange 2
Exchange n
Hardwired control
Flexible
Not flexible
Slower
Faster
Easier to maintained
Difficult to maintained
Availability of Processors
1
MTBF
(2)
MTBF + MTTR
Where MTBF is Mean Time Between Failure and MTTR
is Mean Time To Repair.
Unavailability of system is given by :
U=
1-A =
MTTR
MTBF + MTTR
(3)
Availability of Processors
If MTBF >> MTTR , ignoring MTTR then:
MTTR
U=
(4)
MTBF
2. Dual processor : A dual processor system is said to have
failed only when both processor fails and the total system is
unavailable . The MTBF of dual processor is given by :
(MTBF)D =
(MTBF)2
(5)
2MTTR
Where (MTBF)D = MTBF of dual processor and
MTBF = MTBF of single processor.
(MTBF)D
(6)
Availability = AD =
MTTR + (MTBF)D
Availability of Processors
Substituting the value of (MTBF)D in equation (6)
(MTBF)2/ 2MTTR
AD =
MTTR + (MTBF)2 / 2 MTTR
AD =
(MTBF)2
(7)
(MTBF)2 + 2(MTTR)2
Unavailability = U = 1- AD =
1-
(MTBF)2
(MTBF)2 + 2(MTTR)2
2(MTTR)2
(MTBF)2
(8)
Availability of Processors
Example : Given that MTBF = 2000 hrs and MTTR = 4
hrs. Calculate the unavailability for single and dual
processor systems for 10 years and 30 years.
Solution : Given MTBF = 2000 hrs
MTTR = 4 hrs
U = MTTR / MTBF =4/ 2000 = 2x 10-3
For 10 years :
U = 24hrs x 365 days x 10 x 2 x10-3
U = 175.2 hrs.
For 30 years :
U = 24 hrs x 365 days x 30 x 2 x 10-3
U = 525.6 hrs.
Availability of Processors
Unavailability of dual processor:
2(4)2
UD = 2(MTTR)2
=
(2000)2
(MTBF)2
For 10 years :
= 8 x 10-6
Time Switch
A time slot in conventional PCM contains 8 bits and a basic
frame is 125 second in duration .
For the North America DS1 format , the basic contains 24
time slots and for the European E1 has 32 time slots .
The time duration of an eight bits time slot is 125/24 =
5.2083 sec for DS1 and 125/32 =3.906 sec for E1 .
The time slot interchanging involves moving the data
contained in each time slot from the incoming bit stream to
an outgoing bit stream but with different time slot
arrangement in accordance with the destination of each
time slot .
To accomplish this at least one time slot must be stored in
memory and then called out of memory in changed
position . The operation must be controlled in some
manner and some of these control actions must be kept
together with the software managing such action.
Time Switch
Time Switch
1.
2.
3.
Time Switch
Time Switch
and can be sequential (e.g. in order in which they appear in
the incoming bit stream) .The readout of speech memory is
controlled by control memory.
In this case readout is random where the time slots are
readout in the desired output order. The memory has as
many cells as there are time slots.
For the DS1 for example are 24 cells . The time switch, as
shown work well for a single inlet-outlet switch . With just
24 cells it could handle 23 stations .
How can we increase a switch capacity ? Enter the space
switch as shown in fig.9.3 affords a simple example of this
concept. For example time lot B1 on the B trunk is moved
to the Z trunk into the in to time slot Z1 and timeslot Cn is
moved to the trunk W into time slot Wn , we observe that
there is no change in time slot position.
Space Switch
A typical time division switch is shown in fig. 9.4 It consist of
cross point matrix made up of logic gates that allow the
switching of time slots in the spatial domain.
The PCM time slot bit streams are organized by the switch
into the pattern determined the network connectivity . The
matrix consist of a number of input horizontals and a number
of output verticals with a logic gate at each cross point.
The array as shown in fig. 9.4 , has M inlets and N outlets and
we call it as M x N array. If M=N the switch is non blocking If
M >N the switch concentrates and if M<N the switch expands.
For a given time slot , the appropriate logic gate is enabled
and the time slot passes from input horizontal to desired
output vertical . The other horizontal each serving a different
serial stream of time slots ,can have same time slot (a time slot
from time slot number 1-24,1-30 ,1-n , for instance time slot 7
on each stream) switched into verticals enabling their gates.
Space Switch
In the next time slot position (time slot 8),a completely
different path configuration could occur, allowing time slots
from horizontal to be switched to selected vertical.
The space array (cross points matrix ) does not switch time
slots but as does a time switch . This is because the
occurrence of time slots are identical on the horizontal and
vertical . It switches in space domain not in the time domain .
The control memory in the fig 9.4 enables gates in
accordance with its stored information.
If an array has M inputs and N outputs , M and N may be
equal or unequal depending on function of switch . For a
tandem or transit switch web expect M=N . For local switch
requiring concentration and expansion , M and N would be
unequal
Space Switch
If it is desired to transmit a signal from input 1
(horizontal) to output 2 (vertical) the gate at the
intersection may be activated by placing enable signal on
S12 during desired time slot period.
Then the 8 bits of that time slot would pass through the
logic gate onto vertical. In the same time For example if
array is 20 x 20 and time slot interchanger is placed on
each input (horizontal ) and interchanger handles 30 time
slots , the array then can serve 20 x 30 = 600 different time
slots