@inproceedings {Simula.simula.866,
	title = {Exploring the Scope of the InfiniBand Congestion Control Mechanism},
	journal = {2012 IEEE International Symposium on Parallel \& Distributed Processing (IPDPS)},
	year = {2012},
	pages = {1131-1143},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {In a lossless interconnection network, network congestion needs to be detected and resolved to ensure high performance and good utilization of network resources at high network load. If no countermeasure is taken, congestion at a node in the network will stimulate the growth of a congestion tree that not only affects contributors to congestion, but also other traffic flows in the network. Left untouched, the congestion tree will block traffic flows, lead to underutilization of network resources and result in a severe drop in network performance. The InfiniBand standard specifies a congestion control (CC) mechanism to detect and resolve congestion before a congestion tree is able to grow and, by that, hamper the network performance. The InfiniBand CC mechanism includes a rich set of parameters that can be tuned in order to achieve effective CC. Even though it has been shown that the CC mechanism, properly tuned, is able to improve both throughput and fairness in an interconnection network, it has been questioned whether the mechanism is fast enough to keep up with dynamic network traffic, and if a given set of parameter values for a topology is robust when it comes to different traffic patterns, or if the parameters need to be tuned depending on the applications in use. In this paper we address both these questions. Using the three-stage fat-tree topology from the Sun Datacenter InfiniBand Switch 648 as a basis, and a simulator tuned against CC capable InfiniBand hardware, we conduct a systematic study of the efficiency of the InfiniBand CC mechanism as the network traffic becomes increasingly more dynamic. Our studies show that the InfiniBand CC, even when using a single set of parameter values, performs very well as the traffic patterns becomes increasingly more dynamic, outperforming a network without CC in all cases. Our results show throughput increases varying from a few percent, to a seventeen-fold increase.},
	doi = {10.1109/IPDPS.2012.104},
	author = {Ernst Gunnar {Gran} and Reinemo, Sven-Arne and Lysne, Olav and Skeie, Tor and Zahavi, Eitan and Shainer, Gilad},
	editor = {Werner, Bob}
}
@inproceedings {Hansen.2005.1,
	title = {Resilient Routing Layers for Recovery in Packet Networks},
	journal = {International Conference on Dependable Systems and Networks (DSN 2005) Yokohama, Japan, June 28-July 1},
	year = {2005},
	note = {ISBN 0-7695-2282-3},
	month = {June},
	publisher = {IEEE Computer Society},
	type = {1},
	abstract = {The existing methods for network recovery are often complex and seldom used by network administrators. In this paper we present a novel approach for global and local recovery named Resilient Routing Layers (RRL). The method is supported by algorithms, but also simple enough for a network administrator to implement by hand for reasonably sized networks. The idea in our approach is that for each node in the network there is a topology subset called a {\textquotedblleft}safe layer{\textquotedblright}, which can handle any traffc affected by a fault in the node itself, or any of its links. By analysis using different network topologies, we demonstrate that our approach performs well compared to other comparable methods. Particularly, we demonstrate RRLs performance for backup-path lengths and state information overhead that are assumed to be the weakest parameters for our method. We discuss implementation issues of RRL, and demonstrate its applicability to MPLS networks.},
	author = {Audun Fosselie {Hansen} and Kvalbein, Amund and Cicic, Tarik and Gjessing, Stein and Lysne, Olav},
	editor = {Werner, Bob}
}
