Scribd
Upload
17 views

Day 13

Uploaded by

studyxubuntu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views

Day 13

Uploaded by

studyxubuntu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

STRUCTURE OF A SWITCH

• We use switches in circuit-switched and


packet-switched networks.
• Circuit switching today can use either of two
technologies: the space-division switch or the time-
division switch.
• Packet switch has four components: input ports,
output ports, the routing processor, and the
switching fabric
Space division switch : Crossbar switch
Connects n inputs to m outputs in a grid, using electronic
microswitches (transistors) at each cross point.
Space division switch : Multistage switch
• combines crossbar switches in several (normally three) stages
• In a single crossbar switch, only one row or column (one path) is
active for any connection. So we need N x N cross points.
• If we can allow multiple paths inside the switch, we can decrease
the number of cross points. Each cross point in the middle stage
can be accessed by multiple cross points in the first or third stage
Note

In a three-stage switch, the total


number of crosspoints is
2kN + k(N/n)2
which is much smaller than the
number of
crosspoints in a single-stage switch (N2).
Example

Design a three-stage, 200 × 200 switch (N = 200) with


k = 4 and n = 20.

Solution
In the first stage we have N/n or 10 crossbars, each of size
20 × 4. In the second stage, we have 4 crossbars, each of
size 10 × 10. In the third stage, we have 10 crossbars,
each of size 4 × 20. The total number of crosspoints is
2kN + k(N/n)2, or 2000 crosspoints. This is 5 percent of
the number of crosspoints in a single-stage switch (200 ×
200 = 40,000).
Note
According to the Clos criterion:
n = (N/2)1/2
k > 2n – 1
Crosspoints ≥ 4N [(2N)1/2 – 1]

The multistage switch in has one drawback: blocking during periods


of heavy traffic. Blocking refers to times when one input cannot be
connected to an output because there is no path available between
them-all the possible intermediate switches are occupied. Clos came
up with the formula for non-blocking switch
Example

Redesign the previous three-stage, 200 × 200 switch,


using the Clos criteria with a minimum number of
crosspoints.

Solution
We let n = (200/2)1/2, or n = 10. We calculate k = 2n − 1 =
19. In the first stage, we have 200/10, or 20, crossbars,
each with 10 × 19 crosspoints. In the second stage, we
have 19 crossbars, each with 20 × 20 crosspoints. In the
third stage, we have 20 crossbars each with 19 × 10
crosspoints. The total number of crosspoints is 20(10 ×
19) + 19(20 × 20) + 20(19 ×10) = 15200.
Time Division Switch: Time-slot interchange(TSI)
• TDM multiplexer, a TDM demultiplexer, and a TSI consisting of
random access memory (RAM) with several memory locations.
• The size of each location is the same as the size of a single time slot.
• The number of locations is the same as the number of inputs.
• RAM fills up with incoming data from time slots in the order
received.
• Slots are then sent out in an order based on the decisions of a control
unit.
Time-space-time switch(TST)
Time-space-time switch(TST)

• Two time stages and one space stage and has 12 inputs and 12
outputs.
• divides the inputs into three groups and directs them to three
timeslot interchanges
• Thus the average delay is one-third of what would result from
using one time-slot interchange to handle all 12 inputs
• The last stage is a mirror image of the first stage.
• The middle stage is a space division switch (crossbar) that
connects the TSI groups to allow connectivity between all
possible input and output pairs
Packet switch components
Input port

• Performs the physical and data link functions of the packet


switch.
• The bits are constructed from the received signal.
• The packet is decapsulated from the frame.
• Errors are detected and corrected.
• It also has buffers (queues) to hold the packet before it is directed
to the switching fabric.
Output port and Routing Processor

• First the outgoing packets are queued.


• Then the packet is encapsulated in a frame, and
• finally the physical layer functions are applied to the
frame to create the signal to be sent on the line

The routing processor performs the functions of the


network layer. The destination address is used to find the
address of the next hop and, at the same time, the output
port number from which the packet is sent out.
Switching Fabrics: Banyan switch
Switching Fabrics: Banyan switch

• multistage switch with microswitches at each stage that


route the packets based on the output port represented
as a binary string.
• For n inputs and n outputs, we have log2 n stages with
n/2 microswitches at each stage
• The first stage routes the packet based on the high-
order bit of the binary string.
• The second stage routes the packet based on the second
high-order bit, and so on.
Examples of routing in a banyan switch

The problem with the banyan switch is the possibility of


internal collision even when two packets are not heading
for the same output port
Switching Fabrics: Batcher-banyan switch
Batcher-banyan switch

• Sort the arriving packets based on their destination port


• Batcher designed a switch that comes before the banyan
switch and sorts the incoming packets according to their
final destinations
• Another hardware module called trap is added between
the Batcher switch and the banyan switch
• The trap module prevents duplicate packets (packets with
the same output destination) from passing to the banyan
switch simultaneously.
• Only one packet for each destination is allowed at each
tick; if there is more than one, they wait for the next tick.

You might also like