The RTCC-pyramid: a versatile pyramid network

We present and evaluate a new pyramid topology for interconnection networks, based on the recursive transpose-connected cycles (RTCC) network, which we refer to as the RTCC-pyramid. An L level RTCC-pyramid uses an RTCC network structure in each level as an alternative to the mesh network used to construct the conventional mesh-pyramid network. We study some important properties of these topologies such as diameter and average distance. In addition, a routing algorithm based on the routing in RTCC network is proposed. We prove that this form of the pyramid topology is Hamiltonian-connected, i.e. a Hamiltonian path can be constructed from any node to any other node in the network. We conclude that, insight of most of the mentioned properties, the RTCC-pyramid is a more suitable topology to base both hardware architectures and software structures on, compared to the conventional pyramid topology