Higher dimensional Eisenstein–Jacobi networks

Abstract

An efficient interconnection topology called Eisenstein–Jacobi (EJ) network has been proposed in Martínez et al. (2008). In this paper this concept is generalized to higher dimensions. Important properties such as distance distribution and the decomposition of higher dimensional EJ networks into edge-disjoint Hamiltonian cycles are explored in this paper. In addition, an optimal shortest path routing algorithm and a one-to-all broadcast algorithm for higher dimensional EJ networks are given. Further, we give comparisons between higher EJ networks and Generalized Hypercube (GHC) networks and we show that higher EJ networks cost less and have more nodes than GHC networks.