Performance analysis of generalized multihop shuffle networks

This paper describes the performance analysis of a class of two-connected multihop shufflenets, known as generalized shuffle networks. The topology of such networks is described mathematically by the equation N=kn, where N is the total number of nodes in the network, k the number of stages in the network and n the number of nodes in each stage. Compared to classical shufflenets, the definition of generalized shuffle networks allows a larger number of feasible network structures that are realizable for a given network size N. In attempting to find an optimum network structure, network characteristics are discussed and system performance is evaluated. Important relationships and interdependencies among the various network parameters are developed to facilitate cross-structural comparison