Premium
Strict nonblockingness of reduced shuffle‐exchange networks
Author(s) -
Hwang F. K.,
Zhang Binwu
Publication year - 2005
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20043
Subject(s) - interconnection , computer science , conjecture , multistage interconnection networks , theoretical computer science , discrete mathematics , mathematics , computer network
The shuffle‐exchange network is one of the most well‐studied multistage interconnection networks. Whether a (2 n − 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