The Impact of Path Selection Algorithm of Adaptive Routing for Implementing Deterministic Routing
Michihiro Koibuchi, Akiya Jouraku, Hideharu Amano · 2002
In PC clusters or high performance I/O networks including InfiniBand, network topologies often become irregular. Although various adaptive routings for irregular networks have been proposed, most of such commercial or experimental networks use a deterministic routing which enables a simple switch structure and in-order packet delivery. A strategy of path selection algorithm which fixes a single path among alternative paths between each pair of switches(hosts) is required but only a few studies have been asserted. In this paper, we propose three path selection algorithms which have different concepts using a static analysis of routing path to distribute the traffic, and investigate the influences of path selection algorithms on the throughput. Result of simulations shows that the throughput of each path selection algorithm depends on routing algorithm and topology, and the path selection algorithms using a static analysis of routing path achieves higher throughput compared with one without using it.