Datagram Switching
•No connection setup phase
•Each packet forwarded independently
•Sometimes called connectionless model
0
1
3
2
0
1
3
2
0
1
3
2
Switch 3
Host B
Switch 2
Host A
Switch 1
Host C
Host D
Host E
Host F
Host G
Host H
•Analogy: postal system
•Each switch maintains a forwarding (routing) table