Higher Dimensional Gaussian Networks

Abstract

Gaussian interconnection networks have recently been introduced as a useful alternative to the classical toroidal network, and in this paper this concept is generalized to higher dimensions. We also explore many important properties of this new topology, including diameter and distance distribution. In addition, an optimal shortest path routing algorithm and a one-to-all broadcast algorithm for higher dimensional Gaussian networks are given. Simulation results show that the routing algorithm proposed for higher dimensional Gaussian networks outperforms the routing algorithm of the corresponding torus network of the same node-degree and the same number of nodes.