Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
The turn model for adaptive routing
Journal of the ACM (JACM)
A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Balancing Buffer Utilization in Meshes Using a 'Restricted Area' Concept
IEEE Transactions on Parallel and Distributed Systems
Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Hi-index | 0.00 |
This paper presents an idea of dynamic channel selection to balance traffic for a mesh network. The key idea is to maintain the history of channel utilization in each node and based on the recorded information the node router can predict the current load of the network and route packets through less trafficked or more appropriate channels to avoid congestion. Three dynamic channel selection policies, DCS-I, DCS-II and DCS-III, have been designed, each with specific advantages, to fit different situations. Performance of six established adaptive routing algorithms with five channel selection policies are evaluated through simulation. The results exhibit that when network traffic gets heavy, the proposed DCS-II and DCS-III yield constantly better performance in terms of throughput and communication latency than the other selection policies. DCS-II and DCS-III are also shown to bring about more even buffer utilization - manifesting the important link between balanced network traffic and desired performance.