Evaluation and Comparison of Hypercube Interconnection Networks Performance

Abstract

Hypercube Interconnection Networks are topologies of network that can be employed to interconnect many processing units including modules of memory and are used to route the data accurately. Hypercube Interconnection Networks comprise of 2n nodes. Each node is a vertex of geometric structure to create an internetwork connection. Any Hypercube may be considered as a graph without any directions, where a node represents a processing unit, an edge indicates a link among the processors to communicate. In this paper, different properties are identified to evaluate the Performance of various Hypercube Network variants. A weight metric is designed using the identified properties named “Performance Index”. Performance of Hypercube Interconnection Networks is computed and summarized to identify the efficient variant based on Performance Index.