Performance Analysis of Generalized Multihop Shuffle Networks

This paper describes the performance analysis of a class of two-connected multihop shuflenets, known as generalized shufle 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 shuflenets, the definition of generalized shufle 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.

• Type: Conference
• Year: 1997
• Where: INFOCOM
• Authors: Chiang-Ling Ng, Seung-Woo Seo, Hisashi Kobayashi
• Keywords: Communications, INFOCOM 1997, Network Structure, Shufle Networks, Two-connected Multihop Shuflenets