Optimal Routing Algorithm in Multilayer Octagon-Cell: A New Class of Octagon-Cell Interconnected Networks

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.