Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Outline
Store-and-Forward Switches
Bridges and Extended LANs
Cell Switching
Segmentation and Reassembly
Spring 2002
CS 461
Scalable Networks
Switch
forwards packets from input port to output port
port selected based on address in packet header
T3
T3
STS-1
T3
T3
STS-1
Switch
Input
ports
Output
ports
Advantages
Spring 2002
CS 461
Source Routing
3
0 Switch 1
1
2
3 0 1
2 Switch 2
1
1
2
1 3 0
0
Host A
0 1 3
1
0 Switch 3
3
2
Spring 2002
CS 461
Host B
1
2
Switch 1
5
Each switch
maintains a VC
table
Spring 2002
1
1
1
Switch 2
2
7
3
Host A
0 Switch 3
1
2
CS 461
Host B
Datagram Switching
No connection setup phase
Each packet forwarded independently
Sometimes called connectionless model
Host D
Analogy: postal
system
Each switch
maintains a
forwarding (routing)
table
0
3
Host C
Host E
Switch 1
1
Host F
2 Switch 2
1
0
Host A
0 Switch 3 Host B
Host G
1
3
2
Host H
Spring 2002
CS 461
Example Tables
Circuit Table
(switch 1, port 2)
Forwarding Table
(switch 1)
5
6
11
8
Spring 2002
Address
A
C
F
G
1
1
CS 461
Port
2
3
1
1
Spring 2002
CS 461
Datagram Model
There is no round trip delay waiting for connection setup; a host can
send data as soon as it is ready.
Source host has no way of knowing if the network is capable of
delivering a packet or if the destination host is even up.
Since packets are treated independently, it is possible to route around
link and node failures.
Since every packet must carry the full address of the destination, the
overhead per packet is higher than for the connection-oriented model.
Spring 2002
CS 461
Port 1
Bridge
Port 2
CS 461
Learning Bridges
Do not forward when unnecessary
Maintain forwarding table
A
Bridge
Host
A
B
Port 1
C
X
Port 2
Y
Z
X
Port
1
1
1
2
2
2
Z
Spring 2002
CS 461
10
Problem: loops
B
B3
C
B5
D
B2
B7
K
F
B1
G
H
B6
B4
I
J
(a)
Spring 2002
CS 461
(b)
11
Algorithm Overview
Each bridge has unique id (e.g., B1, B2, B3)
Select bridge with smallest id as root
Select bridge on each LAN closest to root as
designated bridge (use id to break ties)
Each bridge forwards frames
over each LAN for which it
is the designated bridge
A
B3
B5
B2
B7
K
F
B1
G
H
B6
B4
I
J
Spring 2002
CS 461
12
Algorithm Details
Bridges exchange configuration messages
id for bridge sending the message
id for what the sending bridge believes to be root
bridge
distance (hops) from sending bridge to root bridge
Spring 2002
CS 461
13
Spring 2002
CS 461
14
Spring 2002
CS 461
15
Limitations of Bridges
Do not scale
spanning tree algorithm does not scale
broadcast does not scale
Spring 2002
CS 461
16
CS 461
17
Spring 2002
CS 461
18
Spring 2002
CS 461
19
Spring 2002
CS 461
20
Cell Format
User-Network Interface (UNI)
16
GFC
VPI
VCI
Type
CLP
HEC (CRC-8)
Payload
host-to-switch format
GFC: Generic Flow Control (still being defined)
VCI: Virtual Circuit Identifier
VPI: Virtual Path Identifier
Type: management, congestion control, AAL5 (later)
CLPL Cell Loss Priority
HEC: Header Error Check (CRC-8)
Spring 2002
CS 461
21
AAL
AAL
ATM
Spring 2002
ATM
CS 461
22
AAL 3/4
Convergence Sublayer Protocol Data Unit (CS-PDU)
16
CPI
Btag
BASize
< 64 KB
User data
0 24
16
Pad
Etag
Len
Spring 2002
CS 461
23
Cell Format
40
ATM header
10
Type
SEQ
MID
10
Length
CRC-10
Type
BOM: beginning of message
COM: continuation of message
EOM end of message
CS 461
24
AAL5
CS-PDU Format
< 64 KB
0 47 bytes
16
16
32
Data
Pad
Reserved
Len
CRC-32
Cell Format
end-of-PDU bit in Type field of ATM header
Spring 2002
CS 461
25