IDEAS home Printed from https://ideas.repec.org/a/igg/jissc0/v8y2017i3p45-57.html
   My bibliography  Save this article

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

Author

Listed:
  • Jehad Ahmed Al-Sadi

    (Arab Open University, ITC Department, Amman, Jordan)

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.

Suggested Citation

  • Jehad Ahmed Al-Sadi, 2017. "A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks," International Journal of Information Systems and Social Change (IJISSC), IGI Global, vol. 8(3), pages 45-57, July.
    • Handle: RePEc:igg:jissc0:v:8:y:2017:i:3:p:45-57
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISSC.2017070104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jissc0:v:8:y:2017:i:3:p:45-57. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.