Routing in quad tree-hypercube networks
Mahmoud Omari · 2000
This research focuses on developing optimal pointto-point routing algorithm for quad Tree-Hypercube networks (TITs).TH's have been introducad as new fixed interconnection networks.It was shown that they have many hypercube features such as self-routing.In addition, they have advantages over hypercubes in extendibility, diameter, and average distant.In this research, an optimal point-to-point routing algorithm will be presented for quad TITs.It will be shown that the time for routing messages between any two nodes in the network is in the order of 2k, where 2k is the diameter of the network.In addition, the parallel path property in quad Tree-Hypercubes will be studied and the number ofparaUei shortest paths will be computed.