A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks
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.
Year of publication: |
2017
|
---|---|
Authors: | Al-Sadi, Jehad Ahmed |
Published in: |
International Journal of Information Systems and Social Change (IJISSC). - IGI Global, ISSN 1941-8698, ZDB-ID 2579268-4. - Vol. 8.2017, 3 (01.07.), p. 45-57
|
Publisher: |
IGI Global |
Subject: | Hypercube | Interconnection Networks | Routing Algorithm | Topological Properties |
Saved in:
Saved in favorites
Similar items by subject
-
Deterministic small-world networks
Comellas, Francesc, (2002)
-
Properties and Performance of Cube-Based Multiprocessor Architectures
Siddiqui, Jamshed, (2016)
-
An Optimal Routing Algorithm for Internet of Things Enabling Technologies
Dhumane, Amol V., (2017)
- More ...