Chapter 8 Switching
Chapter 8 Switching
1 2
3 4
Figure 8.1 Switched network Figure 8.2 Taxonomy of switched networks
5 6
7 8
Figure 8.3 A trivial circuit-switched network Circuit Switching - Applications
• Inefficient
—Channel capacity dedicated for duration of connection
—If no data, capacity wasted
• Set up (connection) takes time
• Once connected, data transfer is transparent
—Continuous flow of data mixed with silence gap
—No addressing is involved
• Developed for voice traffic (phone)
In circuit switching, the resources need to be reserved
during the setup phase;
the resources remain dedicated for the entire duration of
data transfer until the teardown phase.
9 10
Figure 8.4 Circuit-switched network used in Example 8.1 Figure 8.5 Circuit-switched network used in Example 8.2
11 12
Phases in Circuit Switching Strength and Weakness
• Connection setup • Resource are allocated during the entire connection
duration
—Dedicated line from node to switch
• Minimum delay in data transfer phase
—Dedicated channel between the switches — Setup delay consists of
—Involve addressing and resource reservation • Propagation time of request
• Signal transfer time
—Completed when being acknowledged • Propagation time of acknowledgement
• Data transfer • Signal transfer time
— Data transfer delay consists of propagation time and data
• Teardown transfer time
— No waiting time at switch
Switching at the physical layer in the traditional
telephone network uses the circuit-switching
approach.
13 14
17 18
Diagram
29 30
33 34
Figure 8.14 Setup request in a virtual-circuit network Figure 8.15 Setup acknowledgment in a virtual-circuit network
• Request contains global • Final VCI (77) is • Acknowledgement still • Acknowledgement sent
source and destination assigned by the contains global source out by destination (B)
addresses destination (B) and destination has VCI = 77
• Switch must already — Identify that this frame addresses — Switch 3 uses this info
know outgoing port come from source A, — Allow the switch to to complete its table
through another and no one else reference back to • Connection is only used
permanent routing table corresponding VCI in one direction
table entry
• Incoming VCI is chosen
by the switch 35 36
Efficiency and Delay Figure 8.16 Delay in a virtual-circuit network
39 40
VII. Structure of a Switch Figure 8.17 Crossbar switch with three inputs and four outputs
41 42
Example 8.3
Figure 8.18 Multistage switch
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
• N inputs are divided into N/n groups, each groups has n inputs 2kN + k(N/n)2, or 2000 crosspoints. This is 5 percent of
— One stage-1 crossbar is needed per group the number of crosspoints in a single-stage switch (200 ×
In a three-stage switch, the total number of crosspoints is 200 = 40,000).
2kN + k(N/n)2 which is much smaller than the number of
crosspoints in a single-stage switch (N2). 43 44
Example 8.4
Multistage Switches: Blocking
• Advantage: The number of crosspoints Redesign the previous three-stage, 200 × 200 switch,
• Disadvantage: blocking using the Clos criteria with a minimum number of
—One input cannot be connected to one output crosspoints for non-blocking switch.
because there is no path available
• Even when output is not busy Solution
—Usually caused by small number of crossbars at the We let n = (200/2)1/2, or n = 10. We calculate k = 2n − 1 =
middle stage
19. In the first stage, we have 200/10, or 20, crossbars,
• Clos criterion: condition of nonblocking
each with 10 × 19 crosspoints. In the second stage, we
n ≥ (N/2)1/2 have 19 crossbars, each with 10 × 10 crosspoints. In the
k ≥ 2n – 1 third stage, we have 20 crossbars each with 19 × 10
Crosspoints ≥ 4N [(2N)1/2 – 1] crosspoints. The total number of crosspoints is 20(10 ×
19) + 19(10 × 10) + 20(19 ×10) = 9500.
45 46
47 48
Figure 8.20 Time-space-time switch Figure 8.21 Packet switch components
51 52
Figure 8.24 A banyan switch Figure 8.25 Examples of routing in a banyan switch