Simulation of Infiniband Networks and Effciency Calculation on Non-blocking Fully Populated Fat-Tree Topology

In this paper, we have proposed efficient algorithms for simulating Infiniband networks using a non-blocking fully populated Fat-Tree topology. These algorithms successfully model Fat-Tree Infiniband networks and introduce an efficient routing scheme for multi-source multi-destination routing. Our aim is to use maximum/minimum portion of the topology for each instance of routing and calculate efficiency of network used. Initially we find all possible routes for each source-destination pair. Then, one path is selected per pair such that the constraint of minimum/maximum network usage is satisfied. After final paths have been obtained for all pairs, the network efficiency is calculated. We have considered only latency of links assuming that switches in the network do not have any latency. Hence, this paper includes our algorithms for modelling, routing and performance evaluation of Infiniband networks for a Fat-Tree topology.