1 / 2

3-stage switch; see need for k=2n-1 for it to be non-blocking

3-stage switch; see need for k=2n-1 for it to be non-blocking. A. A. B. B. C. C. D. D. A sends to C; B sends to D; C sends to A; D sends toB See that there is no blocking even if k=2. 3-stage switch; see need for k=2n-1 for it to be non-blocking. A. A. B. B. C. C. D. D. E. E.

dyan
Télécharger la présentation

3-stage switch; see need for k=2n-1 for it to be non-blocking

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. 3-stage switch; see need for k=2n-1 for it to be non-blocking A A B B C C D D A sends to C; B sends to D; C sends to A; D sends toB See that there is no blocking even if k=2 M. Veeraraghavan

  2. 3-stage switch; see need for k=2n-1 for it to be non-blocking A A B B C C D D E E F F A sends to C; B sends to F; E sends to A; Say F wants to send to E – it cannot use the first switch in the intermediate stage because of E to A connection, it cannot use the second switch because the B to F connection has used up the line to the third switch in the output stage. Hence we need the third intermediate switch M. Veeraraghavan

More Related