Packet Switching (basics)

18
Packet Switching (basics)

description

Packet Switching (basics). Crossbar scheduling: “Take-a-ticket”. HOL Probability that none of the N input ports chooses a given output port is (1-1/N) N ≈ 37% So, max throughput of this switch is: 63%. Avoid HOL-blocking with multiple input queues (one per output port). - PowerPoint PPT Presentation

Transcript of Packet Switching (basics)

Page 1: Packet Switching (basics)

Packet Switching (basics)

Page 2: Packet Switching (basics)
Page 3: Packet Switching (basics)
Page 4: Packet Switching (basics)

Crossbar scheduling: “Take-a-ticket”

Page 5: Packet Switching (basics)

HOLProbability that none of the N input ports

chooses a given output port is (1-1/N)N ≈ 37%So, max throughput of this switch is: 63%

Page 6: Packet Switching (basics)

Avoid HOL-blocking with multiple input queues (one per output port)

Page 7: Packet Switching (basics)

PIM: Parallel Iterative Matching

Page 8: Packet Switching (basics)

iSLIP (avoids randomization of PIM)

Page 9: Packet Switching (basics)

iSLIP (cont’)

Page 10: Packet Switching (basics)

Multistage switching

Page 11: Packet Switching (basics)

Blocking vs non-blocking switching networks

Page 12: Packet Switching (basics)

Blocking vs non-blocking switching networks

Page 13: Packet Switching (basics)

Clos network (N, n, k):Non-blocking if k ≥2n-1 (Prove this!)

Page 14: Packet Switching (basics)

Clos network (N,n,k=2n-1):Prove that min number of crosspoints = 5.6N√N

(for n= √ (N/2)

Page 15: Packet Switching (basics)

Banyan networksand

the self-routing property

Page 16: Packet Switching (basics)

Benes network

Page 17: Packet Switching (basics)
Page 18: Packet Switching (basics)