1 / 18

Packet Switching (basics)

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).

twila
Download Presentation

Packet Switching (basics)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Packet Switching (basics)

  2. Crossbar scheduling: “Take-a-ticket”

  3. 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%

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

  5. PIM: Parallel Iterative Matching

  6. iSLIP (avoids randomization of PIM)

  7. iSLIP (cont’)

  8. Multistage switching

  9. Blocking vs non-blocking switching networks

  10. Blocking vs non-blocking switching networks

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

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

  13. Banyan networksandthe self-routing property

  14. Benes network

More Related