@inproceedings {Simula.simula.818,
	title = {DFtree - a Fat-Tree Routing Algorithm Using Dynamic Allocation of Virtual Lanes to Alleviate Congestion in InfiniBand Networks},
	journal = {The Network-Aware Data Management Workshop to be held in conjunction with the IEEE/ACM International Conference for High Performance Computing, Networking, Storage and Analysis (SC{\textquoteright}11)},
	year = {2011},
	month = {November},
	pages = {1-10},
	publisher = {ACM},
	type = {Workshop},
	abstract = {End-point hotspots can cause major slowdowns in interconnection networks due to head-of-line blocking and congestion. Therefore, avoiding congestion is important to ensure high performance for the network traffic. It is especially important in situations where permanent congestion, which results in permanent slowdown, can occur. Permanent congestion occurs when traffic has been moved away from a failed link, when multiple jobs run on the same system, and compete for network resources, or when a system is not balanced for the application that runs on it. In this paper we suggest a mechanism for dynamic allocation of virtual lanes and live optimisation of the distribution of flows between the allocated virtual lanes. The purpose is to alleviate the negative effect of permanent congestion by separating network flows into slow lane and fast lane traffic. Flows destined for an end-point hot-spot is placed in the slow lane and all other flows are placed in the fast lane. Consequently, the flows in the fast lane are unaffected by the head-of-line blocking created by the hot-spot traffic. We demonstrate the feasbility of this approach using a modified version of OFED and OpenSM with fat-tree routing on a small InfiniBand cluster. Our experiments show an increase in throughput ranging from 150\% to 468\% compared to the conventional fat-tree algorithm in OFED.},
	isbn = {978-1-4503-1132-8},
	author = {Wei Lin {Guay} and Reinemo, Sven-Arne and Lysne, Olav and Skeie, Tor},
	editor = {Balman, Mehmet and Byna, Surendra}
}
