Topics: 18-345 - Fall 08 Circuit-Switching Networks 2 Circuit Switching Networks 2
Topics: 18-345 - Fall 08 Circuit-Switching Networks 2 Circuit Switching Networks 2
Lecture 8 • Multiplexing
• SONET
Circuit-Switching
Circuit Switching Networks 2 • Transport
p Networks
• Circuit Switches
Peter Steenkiste • Telephone Network
Reading: Chapter 4
1 2
Transport Networks
• Backbone of modern networks
• Provide high-speed connections: Typically STS-1 up to OC-192
Transport Networks • Clients: large routers, telephone switches, regional networks
• Very high reliability required because of consequences of failure
– 1 STS-1 = 783 voice calls; 1 OC-48 = 32000 voice calls;
Telephone
Switch
Router
Router
Transport Network
Telephone
Switch
Telephone
3 Switch
4
Router
Remove Insert
tributary tributary
1 2 3 4
5 6
4
1
1+1 Linear Automatic Protection
Switching 1:1 Linear APS
Switch Switch
W
T R W
T R
Bridge Selector
APS signaling
T R
P T R
P
• Simultaneous transmission over diverse paths
• Monitoring of signal quality • Transmission on working fiber
T = Transmitter
• Fast switching in response to signal degradation W = Working line • Signal for switch to protection route in response to signal
• Selector simply chooses the better line R = Receiver degradation
• 100% redundant bandwidth P = Protection line • Can carry extra (preemptible traffic) on protection line
7 8
OC-3n
OC 3n
…
OC 3
OC-3n
…
Wn
T R
b
P
T R c
b
c
APS signaling OC-3n
• Transmission on diverse routes; protect for 1 fault Three ADMs connected in Logical fully connected
• Reverts to original working channel after repair physical ring topology topology
• More bandwidth efficient 9 10
2
UPSR UPSR path recovery
1 1
4 2 4 2
P P
W = Working Paths
W = Working line
P = Protection line
P = Protection Paths
3 3
13 14
P P
Standby zSpan
bandwidth 2 Switching 2
4 4
is shared restores
failed line
Spatial Fault on
Reuse working
17 links 18
3 3
3
BLSR Span Switching
1 4-BLSR Properties
W
Equal
delay
• High complexity: signaling required
• Fast line protection for restricted distance
(1200 km) and number of nodes (16)
P
zLine
2
• Spatial
S ti l re-use; higher
hi h bandwidth
b d idth efficiency
ffi i
Switching
4
restores • Suitable for high-speed backbone
failed lines
networks
Fault on • Multiple simultaneous faults can be
working and
protection
handled
links
19 20
3
Router 23 24
4
Optical Switching Topics
• Multiplexing
…
…
Optical
fiber switch
• SONET
…
…
• Transport
p Networks
UX
DeMU
MUX
Output Input
• Circuit Switches
WDM
…
• Telephone Network
WDM
Wavelength
cross-connect
WDM
…
…
WDM
Dropped Added
wavelengths wavelengths 25 26
Link Switch
1 1
2 2
User n 3 Connection 3
of inputs
User n – 1
…
to outputs
…
User 1
27 N N
28
29 30
5
Step-by-step (Strowger) Switch Step-by-step (Strowger) Switch
– Electromagnetic switch
– Sequence of dialed numbers selects output line
0
9
8 0 00
.
7 9
.
6 8
58
5 7
4 6
.
3 5
Line .
2 4
Selector 01
1 3
2 connector
1st selector 1 group
2nd selector
Detailed view of rightmost selector from previous slide
Dialing a number 4658 in a 4-digit Step by Step
31 32
Switch fabric
Electro
mechanical
control logic
for making
contacts
tasks
tasks.
• Nonblocking: Any
input can connect N
SPC
to idle output
Control Signaling Message …
• Complexity: N2 1 2 N –1 N
crosspoints
35 36
6
Multistage Space Switch Clos Non-Blocking Condition: k ≥ 2n-1
• Large switch built from multiple stages of small switches • Request connection from last input to input switch j to last output in output
switch m
• The n inputs to a first-stage switch share k paths through intermediate • Worst Case: All other inputs have seized top n-1 middle switches AND all other
crossbar switches outputs have seized next n-1 middle switches
• Larger k (more intermediate switches) means more paths to output • If k ≥ 2n-1 , there is another path left to connect desired input to desired output
• In 1950s, Clos asked, “How many intermediate switches required to
make switch nonblocking?”
nxk N/n x N/n kxn
2(N/n)nk + k (N/n)2 crosspoints 1
1
1
…
n×k N/n × N/n k×n n-1
1 1
busy N/n x N/n
1
Desired nxk n-1 kxn Desired
n×k k×n input j m output
N 2
N/n × N/n
2 N N/n x N/n
n-1
inputs n×k 2 k×n outputs n+1 busy
…
3 3 # internal links =
…
…
2n-2
n×k k×n nxk
N/n N/n kxn
N/n × N/n 37 N/n
Free path N/n2n-1
x N/n Free path N/n 38
k
1152 outputs
8x16 16x8
nputs
450 Gbps 2
144x144
2
1152 in
0 = δC = 4N – 2N2 + 2N ≈ 4N – 2N ==> n ≈ √ N
2 2 • Clos Nonblocking Design for 8x16 2 16x8
3
δn n2 n3 n2 2 1152x1152 switch 3
…
…
…
– N=1152, n=8, k=16
The minimized number of crosspoints is then: – N/n=144 8x16 switches in first 8x16 16x8
144 N/n
stage 144x144
C* = (2N + )(2( N
N2 – 1) ≈ 4N √ 2N = 4 √ 2
)1/2 N1.5 16
N/2 2 – 16 144x144 in center stage
This is lower than N2 for large N – 144 16x8 in third stage
– Aggregate Throughput: 3.6 Tbps!
39 40
Summary
• Multiplexing
• SONET
• Transport Networks
• Circuit Switches
• Telephone Network
41