Abstract
AbstractThe shuffle‐exchange network is one of the most well‐studied multistage interconnection networks. Whether a (2n − 1)‐stage shuffle‐exchange network is rearrangeable has been a challenging conjecture for some 30 years, and only recently a proof was claimed. In this article, we use the analysis method developed for EGSN networks to show that the shuffle‐exchange network can be strictly nonblocking by deleting some inputs and outputs. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45(1), 4–8 2005
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.
