A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks

Abstract

The Hyper Hexa-Cell topology; HHC for short; is a new interconnection network topology that has many attractive topological properties compared to other traditional topologies. There have been a number of studies in the literature on the HHC to explore the promising topological properties of this topology. Furthermore, other studies extend this topology by combining it with OTIS technology to produce a new version called OHHC. We have found that there is a lake of presenting any point to point routing algorithm for the HHC, although there were some efforts on building routing algorithms for the OHHC. To cover this shortage, this paper introduces a new unicast routing algorithm for the HHC. The new routing algorithm for the HHC uses store-and-forward technique which allows a message to be transmitted through a path from the source node to the destination node. In addition to presenting the routing algorithm, we present an example to explore the algorithm steps and also an enhancement on the routing algorithm to apply adaptively on the routing based on parameterized criteria. Finally, we present a theoretical theorem to prove that the algorithm routes any message from any source to any destination via an optimal path.

Load Balancing Problem on Hyper Hexa Cell Interconnection Network

“…One of these interconnection networks is Hyper Hexa Cell, which was built on the advantageous features of the hypercube interconnection network and had attractive topological properties such as diameter, minimum node degree, width of bisection and optical cost [3]. This encouraged the researchers to use this new architecture in solving many parallel algorithms in different fields, such as broadcast communication [4], unicast routing [5] and parallel prefix sum [6]. Moreover the optical links version of this interconnection network namely OTIS-HHC, was exploited by the researchers in order to solve various problems, such as communication algorithms [7], shortest path routing on OTIS-HHC [8], parallel heuristic local search algorithms [9], routing and sorting algorithms [10], parallel quick sort algorithm [11], and traveling salesman problem [12].…”