Several Types Of Parallel Paths In The Interconnection Network Routing Algorithm

To study the routing problem of finding parallel paths between two distinct nodes, and provide the theoretical basis for message exchange among processors in multiprocessors systems, some algorithms have been proposed in some issues. But they are almost for special interconnection network structures. In this paper we gives a new algorithm of finding parallel paths, called divided-joining algorithm. We reply it on the Fibonacci cube and crossed cube successfully in this paper.Interconnection network can be modeled as a graph, if a vertex represents a node of processor (or a station) and an edge between two vertices is a link (or connection) between those two processors. With the method we can study interconnection network in graph theory.The Fibonacci cube possesses attractive recurrent structures. It can be embedded as subgraph in the hypercube, and it is also a supergraph of other structures. Tong has studied the routing problem of finding two parallel paths between arbitrary two nodes s and d on w-dimensional Fibonacci cube. If m=min{l:$