Issue No. 11 - November (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.177307
<p>Benes networks are nonblocking rearrangeable networks that can realize arbitrary permutations without conflict. A class of 2 log/sub b/ N stage networks which are equivalent to the Benes networks is introduced. Networks in this class can be either symmetric or asymmetric in their structure, regular or irregular in their interstage connections, and even, 2 log/sub b/ N or 2 log/sub b/ N-1 stages. All networks in this class are nonblocking rearrangeable. A switch labeling scheme is proposed to provide testing of the topological and functional equivalency for this class of networks. This switch labeling scheme can also provide a novel matrix representation for network configuration. This representation introduces a portability concept for the routing scheme on this class of networks. With this representation, a general routing scheme is also developed. This routing scheme can realize arbitrary permutation for the whole class of 2 log/sub b/ N stage networks.</p>
topological equivalency; rearrangeable networks; Benes networks; nonblocking rearrangeable networks; arbitrary permutations; symmetric; asymmetric; switch labeling scheme; functional equivalency; matrix representation; network configuration; portability concept; routing scheme; arbitrary permutation; computer architecture; computer networks; switching networks.
T. Feng, Yao-Ming Yeh, "On a Class of Rearrangeable Networks", IEEE Transactions on Computers, vol. 41, no. , pp. 1361-1379, November 1992, doi:10.1109/12.177307