Download
1 / 18
180 likes | 294 Vues
This content explores the fundamentals of packet switching, highlighting crossbar scheduling techniques like "Take-a-ticket" and the concept of Head-Of-Line (HOL) blocking. It examines the probability associated with input ports and output port selection, revealing that the maximum throughput cannot exceed 63% due to HOL blocking. Furthermore, the text discusses efficient switching methods such as Parallel Iterative Matching and the iSLIP algorithm, as well as the properties of blocking vs. non-blocking switching networks, with a focus on Clos networks and their configurations.
E N D
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%
Avoid HOL-blocking with multiple input queues (one per output port)
Clos network (N, n, k):Non-blocking if k ≥2n-1 (Prove this!)
Clos network (N,n,k=2n-1):Prove that min number of crosspoints = 5.6N√N (for n= √ (N/2)
