Strict nonblockingness of reduced shuffle-exchange networks

Abstract

The 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. (C) 2004 Wiley Periodicals, Inc.