Sanjukta Mohanty and Prafulla Ku. Behera
1North Orissa University, Sriram Chandra Vihar, Takatpur, Baripada, Odisha, India
2Utkal University, Vani Vihar, Bhubaneswar, Odisha, India
ABSTRACT
Octagon-Cell interconnected network can be viewed as an undirected graph, in which vertices and edges
can be compared with processors and bidirectional communication links respectively between the
processing elements. It has attractive features like small diameter and better bisection width and constant
node degree. It is analyzed to arrive at fault-tolerant communication. A fault tolerant communication
scheme for this network is described in this paper. Here an efficient routing scheme has been described
which routes the horizontal moving messages from source node to the destination node in presence of faulty
nodes / link failure along the path. In this algorithm when a message is received by an intermediate node, it
will consider itself a new source node.
KEYWORDS
Interconnected networks, Octagon-cell, Routing Algorithm, Network services
No comments:
Post a Comment