Abstract
We study the blocking probabilities of multistage switching networks through their linear graphs using Lee's model. We give results which allow us to compare the blocking probabilities of various classes of linear graphs. In particular, we derive techniques for deciding when the blocking probability of one linear graph does not exceed the blocking probability of another linear graph under all possible traffic loads. This allows us to compare the blocking performances of corresponding switching networks containing these linear graphs. Our results apply not only to series-parallel linear graphs, but also to the more general “spider-web” linear graphs, which have recently attracted substantial interest in the theory of switching networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
