Packet Switching (basics)

1
Packet Switching (basics)
2
(No Transcript)
3
(No Transcript)
4
Crossbar scheduling Take-a-ticket
5
HOLProbability that none of the N input ports
chooses a given output port is (1-1/N)N 37So,
max throughput of this switch is 63
6
Avoid HOL-blocking with multiple input queues
(one per output port)
7
PIM Parallel Iterative Matching
8
iSLIP (avoids randomization of PIM)
9
iSLIP (cont)
10
Multistage switching
11
Blocking vs non-blocking switching networks
12
Blocking vs non-blocking switching networks
13
Clos network (N, n, k)Non-blocking if k 2n-1
(Prove this!)
14
Clos network (N,n,k2n-1)Prove that min number
of crosspoints 5.6NvN (for n v (N/2)
15
Banyan networksandthe self-routing property
16
Benes network
17
(No Transcript)
18
(No Transcript)