Sunteți pe pagina 1din 67

Switching Networks

Single Stage Network


The fig shows M inlets and N outlets ,consisting of matrix of
crosspoints ,these may be separate relays or electronics
devices or contacts of crosspoints.
This switch gives full availability , no call lost unless
outgoing trunks are congested.
The system contains M x N crosspoints . If M = N then
number of crosspoints is :
C1 = N
The cost increased as the square of the size of the switch
.The efficiency (N/N = I/N ) decreases inversely with N.
It is uneconomical to use single stage network for large
number of inlets and outlets.

N outlets
1

9 10

1
2
3
4

M inlets

5
6
7
8
9
10

Crossbar Switch (also called Crosspoint switch)

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.

Two Stage Switching Networks

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

Two Stage Switching Networks


The total No. of crosspoints from equation (1) is :
C2 = 2gn = 2N/n
putting value of n = N
C2 = 2N/ N
C2 = 2 ( N )3/2
(4)
Select one of nearest integer to n that is factor of N. Crossbar
switch may be of size 10 x 10 or 10 x 20 .
It is economic to use the network with more than two stages.

Two Stage Switching Networks


Example : Design a two stage network for connecting 200
incoming trunks to 200 outgoing trunks.
Let n = 200 = 14.14 ,however n must be factor of 200, so
nearest possible values are n = 10 and n = 20 . Two possible
networks are shown below:

n
200
incoming
trunks

10x10

20 switches
n

20x20

200
outgoing
trunks

10 switches
n

10x10

Fig (a)

20x20

Two Stage Switching Networks

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.

Two Stage Switching Networks


The fig (a) have same No. of outgoing and incoming trunks.
However concentrator have more incoming trunks than
outgoing trunks and expander have more outgoing trunks
than incoming trunks .
Consider the concentrator with M incoming trunks and N
outgoing trunks (M >N) , let primary switches have m
inlets and each secondary switch has n outlets then.
No. of primary switches = M/m
No. of secondary switches = N/n
No. of crosspoints per primary switch = m N/n
No. of crosspoints per secondary switch = n M/m
Total No. of crosspoints are:
C2 = M/m x mN/n + N/n x n M/m
C2 = MN [ 1/n + 1/m ] (1)

Two Stage Switching Networks


No. of links = No. of primary switches x No. of secondary
switches = MN/ mn.
Since traffic capacity is limited by No. of outgoing trunks ,
there is not feasible to provide more than this number of
links . So No. of links be N .
MN/mn = N
n = M/m
(2)
substituting value of n from equation (2) to equation (1)
C2 = MN[1/M/m + 1/m] = MN[ m /M + 1/m]
(3)
In order to minimize C2 , treat m as if were a continuous
variable and differentiating w.r.t. m
dc2/dm = MN [I/M - 1/m2] = 0 , when m = M
From equation (2) m = n = M

Two Stage Switching Networks


When m = M
Equation (2)
m = n = M
(4)
The No. of crosspoints are minimum if No. of inlets per
primary switch = No. of outlets per secondary switch , from
equation (3)
C2 = MN [1/M + 1/ M ]
= MN [1 + 1 ]
M
C2 = 2 (M) N

(5)

m and n are integer and factor of M and N respectively. If M


> N equation (4) gives larger and fewer secondary switches
than if n = N were chosen . To obtained an expander , M is
exchanged with N and m with n.

Three Stage Switching Networks


B Links

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

Fig shows three stage switch

g2 x n
g3 = N/n Tertiary
switches

g2x n

n
N
outlets

Three Stage Switching Networks

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)

Three Stage Switching Networks

Differentiating equation (1) w.r.t. n and equating to zero. No. of


crosspoints are minimum when
n = N/2
(2)
C3 = 2 2 ( N ) 3/2
C3 = 2 X C2
C3 = (2) 3/2 (N) - C1

(3)

If a three stage concentrator has M incoming trunks and N


outgoing trunks (M > N) . The primary switches have m inlets
and tertiary switches have n outlets then :
No. of primary switches = M/m
No. of tertiary switches = N/n
If there are g2 secondary switches
Crosspoints per primary switch = mg2
Crosspoints per secondary switch = M/m x N/n
Crosspoints per tertiary switch = N/n

Three Stage Switching Networks

The total No. of crosspoints is :


C3 = M/m x mg2 + M/m x N/n x g2 + N/n x ng2.
C3 = Mg2 + MN/mn g2 + Ng2
C3 = g2[M + N + MN/mn]
(4)
Since M>N , No. of A Links = No. of B Links
N = g2 M/m = g2 N/n
Hence g2 = n and m = n M/N
Substituting equation (4)
C3 = (M + N ) n + N2/n
Differentiating w.r.t. n to find minimum
m = M/ M + N , n = N/ M + N
C3 = 2N N + M
(5)
To obtain an expander M exchanged with N and m with n.

Common Control System


Principle of Common Control
Common control system was first introduced in crossbar
exchanges. The common control can be traced in director
system facilitate the uniform numbering of subscribers in
multi-exchange area.
Uniform numbering is that to call a particular subscriber ,the
same number is dialed ,no matter from which exchange the
call is originated.
Consider multi-exchange network shown in fig 3.1 , it is not
fully connected network . If a subscriber in exchange A wants
to call a subscriber F , the call is routed at least three
exchanges. Two routes are possible
A B C J - F and A I H G - F

Common Control System


E

Multi-exchange
network

F
JI

G
C

H
I

Fig 3.1
A

Common Control System

The ten levels can be connected to 10 different exchanges.


From
Exchange

Outlet

To Exchange

01

02

04

03

05

02

01

Common Control System

1.
2.

Let 1457 be subscriber to be called in exchange F from


exchange A . The called subs can be reached by dialing
either of following sequence .
For route A B- C- J- F 01-04-03-01
1457
For route A-I-H-G-F
02-05-01-02
1457
If routing is done by exchange and uniform numbering
scheme is presented as for as user is concerned , the
numbering may consist of
An exchange identifier.
Subscriber line identifier within the exchange.
The exchange must have capable of receiving and storing
the dialed digits ,translating the exchange identifier in
the routing digits and transmitting the routing and subs
line identifier digits to switching network. This function
is perform by director system in Strowger Exchange.

Common Control System

As soon as the translated digits are transmitted , the director


is free to process an other call and is not involve in
maintaining the circuit for conversation.
Call processing is independent of switching network.
Functional diagram of common control system is shown in
fig.3.2 , the control functions in switching system placed in
four broad categories.
1. Event Monitoring
2. Call Processing
3. Charging
4. Operation and Maintenance.

Common Control System


Data or Information Path
Calling
Susbs

Control Path

Switching
Network

Line Unit

Register
Finder

Line unit

Called
Susb

Common control
system

Call processing sub system

Digit Receiver
and Storage
Register
Initial
Translator

Register
Sender

Charging
Circuit

Operation
Control

Final
Translator

Mtce.
Circuit

Event
Monitor

Common Control System

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 .

Common Control System

Identity of calling line is used to determine the category


and class of service to which subs belongs .
Call Processing
A register is chosen which send out dial tone to
concerned subscriber .
As soon as initial digits (usually 2 to 5 ) which identify
the exchange are received in the register , they are passed
on to initial translator for processing ,similarly the
register continue to receive the remaining digits .
The initial translator determine the route for call
through network and decide whether call should put
through or not. It also determine charging method and
rates applicable to subscriber.

Common Control System


Decision such as service information of subscriber as follow :
1. Call barring : A subs may be barred from making
certain calls e.g. STD or ISD barring.
2. Call Priority: When exchange or network is overloaded
only calls from subscribers identified as priority calls
may be put through.
3. Call Charging : It is possible to define different charging
rules for different subscribers in same exchange.
4. Origin based Charging : Routing or destination of
certain calls may depend on geographical location calling
subscribers.
5. No. dialing calls: These calls are routed to predetermined
number without calling party to dial e.g. hot line
connection.

Common Control System


If the call is destined to a subs within the same exchange,
the digits are processed by final translator .
The translation to directory number to equipment number
take place at that stage .
The final translator may determine line unit to which call
must be connected and category of called line, for example
there may be no charge for emergency numbers or fault
repair service line.
Controlling the Operation of switching network is an
important function of common control subsystem.
This is done by making the switching elements and
different stages in the set of binary data defining paths and
then connecting the actual connection path.

Common Control System

Administration of Telephone Exchange


involves activities such as new subs line and trunk into
service .
Modifying subscriber service entitlement and changing
routing plans based on network status. Control subsystem
may facilitates such administrative functions.
Maintenance Activities
May includes supervision and proper functioning of
exchange equipment , subscribers lines and trunks.
It should be possible for maintenance personnel to access
any line or trunk for performing tests and making
measurements of different line parameters.

Electronics Switching System


In electromechanical exchanges common control mainly used
switches and relays which were originally designed for switching
system.
In common control they are used more frequently and wear out
earlier .
In contrast the life of electronics devices is almost independent of
its frequency of operation.
This gave an incentive for development of electronic common
control.
Advances made in computer technology were incorporated and
led to the development of stored program control (SPC) .
This enables a digital computer to be used as central control and
perform different functions through same hardware by executing
different programs. As a result digital exchange can offer vide
variety of facilities than earlier systems.

Electronics Switching System

1.

2.
3.
4.
5.
6.

The facilities provided to the individual customer can be readily altered


by changing customer class of service data stored in a central electronic
memory , some of the facilities can be controlled by customers are as
below :
Call barring (incoming or outgoing ): The customer can prevent
unauthorized calls being made and prevent incoming calls when wishing
to be left in peace.
Repeat last call : If call line is engaged the caller can try again with
having to redial the full number.
Remainder Calls : The exchange can be requested to call the customer
at prearranged time (e.g. for wakeup calls).
Call Diversion : The exchange can be instructed to connect calls to a
different number when customer goes away.
Three Way Call : The customer can be instruct the exchange to connect
third party to a call that is already in progress.
Charge Advice : As a result of caller sending the appropriate
instruction when starting the call , the exchange call back at the end of
call to indicate the call duration and charge.

Stored Program Control


Modern digital computers use the stored program control
concept.
A program or set of instructions to the computer are stored in
memory and are executed automatically one by one by
processor.
Carrying out the exchange control functions through program
stored in the memory of computer led to the nomenclature
stored program control.
Common channel signaling (CCS ), centralized maintenance
and automatic fault diagnosis and interactive human machine
interface are some of features that have become possible due to
application of SPC to telephone switching .
A telephone exchange must operate without interruption 24
hours a day ,365 days a year and for 30 to 40 years . This
means that computer controlling the exchange must be highly
tolerant to fault

Stored Program Control


The 1st electronics switching system known as No. 1 ESS was
installed in New Jersey in 1965. Since then electronics switching
system and stored program control rapid growth in range of
services.
The two type of electronics switching systems (space division) ,
one using electromechanical and other using electronics switching
system. With evolution of time division switching ,which is done in
electronics domain .
Modern exchanges are fully electronics.
Electronics
Electromechanical
Switching n/w

Fig (a)

Stored program
control

(a). Electromechanical
Switching system
(b). Electronics Switching
system

switching n/w

Stored program
control

Fig ( b )

Stored Program Control


There are two approaches to organize stored program control
1. Centralized SPC 2. Distributed SPC

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

Typical Centralized SPC organization


To lines

From lines

Signal
Distributor

Scanners

Processor
Maintenance
console

Memory

Secondary storage:
Call recording,
program
storage etc

Stored Program Control


A redundant centralized structure is shown in fig .A
redundancy is also provided at the level of exchange
resources and function program.
In actual implementation the exchange resources and
memory modules containing program for carrying out the
various functions may be shared by processors.
Or each processor may have its own dedicated access path
to exchange resources and its own copy of program and
data in dedicated memory modules.
In almost all the present day electronic switching systems
using centralized control , only two processors
configuration is used .

Stored Program Control


A dual processor configuration architecture may be configured
to operate in one of three modes.
1. Standby mode.
2. Synchronous duplex mode.
3. Load sharing mode.
1
Standby Mode

Standby mode of operation is simplest of the dual processor


configuration operation .

Normally one processor is active and other is in standby


mode, both hardware and software wise.

The standby processor is brought into service only when


active processor fails. An important requirement of this
configuration is the ability of standby processor to
reconstitute the state of exchange system, when it takeover
the load i.e. to determine which of the subscriber and trunk is
busy, which of path is connected to switching network.

Stored Program Control


The active processor copies the status system periodically ,say
every 5 seconds into a secondary storage.
When switchover occurs , the online processor loads the most
recent update of system status from secondary storage and
continue system operation.
In this case only the calls which changed status between last
update and failure of active processor are disturbed.
Exchange
environment
P1
Processor
P1 = Active processor
P2 = Standby processor

P2
Processor
Secondary
storage

Fig 4.4

Stored Program Control


Synchronous Duplex Mode :
In this configuration hardware coupling is provided
between two processors which execute same set of
instructions and compare the results continuously .
If a mismatch occurs, the faulty processor is identified and
taken out of service within few milliseconds .
When system is operating normally, the two processor
have same data in their memories all time and
simultaneously receive all information from exchange
environment .
One of the processor actually control the exchange while
other is synchronized with former but does not participate
in the control of exchange.
The synchronized configuration is shown in fig 4.5 .

Stored Program Control


Exchange Environment

P1

M1

P2

M2

C= Comparator, M = Memory, P = Processor


Fig 4.5 Synchronous Duplex Mode

Stored Program Control


If a fault is detected by comparator, the processors P1 and
P2 decoupled and checkout program is run independently
on each processor to detect which is faulty.
The checkout program run without disturbing the call
processing . When processor is taken out of service on
account of failure or for maintenance , the other processor
operates independently .
When a faulty processor is repaired and brought into
service , the memory content of active processor are copied
into memory.
It is brought in to synchronous operation with active
processor and then comparator is enabled.

Stored Program Control


3

Load Sharing Mode :

In this operation , an incoming call is assigned randomly or


predetermined order to one of processor which handle call till
completion.
Both the processor are active simultaneously and share the
load and resources . The configuration is shown in fig 4.6.
Both the processors have access to the entire exchange
resources . The calls are handled independently by
processors.
They have separate memories to store temporary call data .
There is inter processor link through which processors
exchange needed for mutual coordination and verifying the
state of other.

Stored Program Control


If exchange of information fails , one of processor which
detect the same takeover entire load including calls that are
already setup by failing processor are usually lost.
Under normal operation each processor handle one half of the
calls load .
Exchange operator can send command to split the traffic
unevenly between two processors.
Load sharing mode give better performance in presence of
traffic overload as compare to other operating modes.
Load sharing mode increases the effective traffic capacity by
30 % compared to other modes.
Load sharing is step toward distributed call control.

Stored Program Control

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

Fig 4.8 . Level control function

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

Fig 4.9 Dual chain distribution control

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

Fig 4.10 . Remote operation and maintenance

Comparison of Hardwired and Stored Program Control .


A control unit designed as a collection of logic circuits using
logic elements ,electronics or otherwise is called hardwired
control unit.
The hardwired lacks flexibility and cannot be easily adopted
to new requirements. A micro program is more universal and
can be put to many different uses by simply modifying the
program and associated data.
When processing is complex microprogramming is easy to
implement. Table below shows the characteristics of the
microprogramming and hardwired control.

Comparison of Hardwired and Stored Program Control .


Micro programmed control

Hardwired control

Flexible

Not flexible

Slower

Faster

More expansive for moderate Less expansive for moderate


processing function
,simple and fixed processing
Easier to implement complex
processing function

Difficult to implement complex


processing function

Introduction of new services


is easy

Not easily possible

Easier to maintained

Difficult to maintained

Availability of Processors
1

The availability of single processor is defined as


A=
uptime
(1)
Uptime + downtime
A=

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

If MTBF >> MTTR ,then ignoring MTTR.


U=

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

= 24 hrs x 365 days x 10 x 8 x 10-6 = 0.7008 hrs


= 42.04 minutes.
For 30 years :
= 24 hrs x 365 days x 30 x 8 x 10-6
= 2.1 hours.

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.

Typical control actions are time slot idle or busy .


There are three basic blocks of time switch.
Memory for speech
Memory for control
Time slot counter or processor.
These three blocks are shown in figure.
In the first case sequential write , the time slots are
written into the speech memory as they appear in the
incoming bit stream .
For the 2nd case the random write, the random write , the
incoming time slots are written into memory in the order
of appearance in the outgoing bit stream . This means that
the incoming time slots are written into memory in the
desired output order.
The writing of incoming time slots are controlled by a
simple time slots counter and can be sequential.

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 Connects Time Slots

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.

Time Division Space Switch

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

Connectivity of Space Switch

S-ar putea să vă placă și