Optimal Routing Algorithm in Multilayer Octagon-Cell: A New Class of Octagon-Cell Interconnected Networks
Journal Title: Transactions on Networks and Communications - Year 2017, Vol 5, Issue 1
Abstract
In communication system of network routing algorithm acts an important role. The efficiency of a parallel system depends on the reliable and efficient routing algorithm which is used to route the messages between the fault-free nodes. In this paper a new class of interconnection network of Octagon-Cell is introduced, which is called Multilayer Octagon-Cell (MLO). The structure of Multilayer Octagon-cell is recursive in nature. It can be expanded, if we increase the depth of MLO. This paper introduces the node degree, diameter, number of links, bisection width of the MLO network and we have also developed the optimal routing algorithm of MLO.
Authors and Affiliations
Sanjukta Mohanty, Prafulla Ku. Behera
Keywords
Related Articles
- EP ID EP301380
- DOI 10.14738/tnc.51.2466
- Views 64
- Downloads 0
Whisper: A High Capacity File Encrypting and Hiding Method in an Audio File
The advance of internet and multimedia allows for tremendous transferring of digital media data and the percentage of time that users spend in online activity and exchanging important information is increasing day by day...
Isolation of Water Inflow to Production Wells
N/A
Seven Cool Number Patterns
Inspired by a number pattern found while reading an online newspaper seven number patterns are created. Behind each pattern there is a distinct algorithm. Some of these patterns are a sequence of a single or double digit...
Performance Evaluation of Multi‐hop Wireless HART Network on a Real‐life Testbed
Advances in WirelessHART standard in industrial control systems have led to performance evaluation and security analysis in both real‐world testbeds as well as in controlled lab environments. We have conducted months‐lon...
Searching Isomorphic Graphs
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other....