SHORTEST PATH ROUTING IN EXCHANGED FOLDED HYPERCUBE

K.Bhavani, P.Venkat Reddy, Sudarson Jena, V. Kamakshi Prasad

Abstract: Routing plays a vital role in transmission of data from one node to another in interconnection networks and also used to determine the performance of the network . In this paper the shortest path routing for Exchanged Folded Hypercube is proposed whose diameter is s+t when s=2 and t=2.we have also provided the conditions for determining the path from node u to node v in graph EFH(s,t) which determines a path of length s+t . We have also shown the broadcasting communication from the source node to different destination nodes by using improved exchanged tree which is a spanning tree and having the properties of binary tree.

Keywords: Exchanged Folded Hypercube, Hypercube, Routing Algorithm, Interconnection of Networks.

DOI: https://doi.org/10.15623/ijret.2016.0517024