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.
The aim of this research is to develop optimal packet routing strategies for the Mesh Hypercube (MH) network of arbitrary size. MH has been introduced as a new interconnection network for multicomputer systems. The basic structure for this network is a combination of both mesh and hypercube networks. In this research, the parallel path property in the MH is studied and the length and the number of parallel shortest paths are computed. An optimal packet routing algorithm is given which uses minimal length path. The algorithm is simple and appears to be well suited to VLSI implementation. The simulation results of the proposed algorithm on various network designs showed that it performs very well at various network conditions. In a MH of size mn nodes, the algorithm performs outstandingly when nm. Specifically, the best results of both waiting-time and packet-latency network performance measures were achieved when m=4 and n=16, while the worst values of all measures were obtained when m=8 and n=8.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.