Routing algorithm and diameter of hierarchical hyper-star network

Abstract

In this paper, we propose a new interconnection network topology, hierarchical hyper-star network HHS(Cn,Cn) is based on hyper-star network. Hierarchical networks based on hypercube have been previously proposed; it has been shown that these networks are superior to the basic networks, in terms of various performance including diameter, network cost, fault tolerance etc. Our results show that the proposed hierarchical hyper-star network performs very competitively in comparison to hyper-star network, HCN(n,n), and HFN(n,n) have been previously proposed. We also investigate a various topological properties of the hierarchical hyper-star network HHS(Cn,Cn) including routing algorithm, diameter, connectivity, broadcasting.

Keywords: interconnection network, parallel processing, routing algorithm, graph

DOI: 10.54941/ahfe1003982