Packet routing algorithms for integrated switching networks
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Integrated switching networks: a performance study
Integrated switching networks: a performance study
Networks for parallel processors: measurements and prognostications
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Routing in Mesh Architectures
IEEE Transactions on Parallel and Distributed Systems
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
IEEE Transactions on Parallel and Distributed Systems
Adaptive and Deadlock-Free Routing for Irregular Faulty Patterns in Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
All commercial hypercubes use fixed-path routing for packet switching. However, it has long been known that adaptive routing reduces packet delay by sending packets via less congested areas. Moreover, the hypercube topology contains many alternative, equal-length paths, suggesting the desirability of adaptive routing. Noting the importance of a communication system and the efficiency of adaptive routing, we investigate the effect of packet routing on communication latency and message throughput in a hypercube. As a feasibility study of adaptive routing, we selected four representative adaptive routing methods for testing on the Intel IPSC: NRCC routing, shortest queue, delta, and hybrid weighted routing. In NRCC routing, a single node, the network routing control center (NRCC), collects network status information and distributes routing tables to all other nodes. In contrast, shortest queue routing is fully distributed; each node selects the link with the shortest queue of outgoing messages that is the part of a shortest path to the destination node. Delta and hybrid weighted routing are hybrid schemes, combining centralized NRCC routing and distributed shortest queue routing. Extensive simulation studies and implementation confirm the superiority of adaptive routing to the fixed-path routing in commercial hypercubes. This result holds for a variety of traffic models, including high temporal locality and traffic surges.