Title: Strict nonblockingness of reduced shuffle-exchange networks
Authors: Hwang, FK
Zhang, BW
應用數學系
Department of Applied Mathematics
Keywords: shuffle-exchange network;strictly nonblocking;EGSN network
Issue Date: 1-Jan-2005
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.
URI: http://dx.doi.org/10.1002/net.20043
http://hdl.handle.net/11536/24613
ISSN: 0028-3045
DOI: 10.1002/net.20043
Journal: NETWORKS
Volume: 45
Issue: 1
Begin Page: 4
End Page: 8
Appears in Collections:Articles


Files in This Item:

  1. 000226130000002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.