@inproceedings {Simula.ND.31,
	title = {A Routing Methodology for Dynamic Fault Tolerance in Meshes and Tori},
	journal = {International Conference on High Performance Computing (HiPC)},
	year = {2007},
	pages = {514-527},
	publisher = {Springer-Verlag},
	type = {Conference},
	abstract = {This paper proposes a fully distributed fault-tolerant routing methodology for tori and meshes. A dynamic fault-model is supported, enabling the network to remain fully operational at all times. Contrary to most previous proposals that support a dynamic fault-model, the methodology is able to tolerate concave fault regions, thereby avoiding disabling healthy nodes in most practical scenarios. The methodology provides high network performance through the use of adaptive routing and provides graceful performance degradation in the presence of faults.},
	isbn = {978-3-540-77219-4},
	author = {Nils Agne {Nordbotten} and Skeie, Tor},
	editor = {Aluru, Srinivas and Parashar, Manish and Badrinath, Ramamurthy and Viktor K. {Prasanna}}
}
@inproceedings {ND.5.Reinemo.2003.b,
	title = {Admission Control for DiffServ Based Quality of Service in Cut-Through Networks},
	journal = {Proceedings of the 10th International Conference on High Performance Computing (HiPC 2003)},
	year = {2003},
	month = {December 17-20},
	pages = {118-129},
	publisher = {Springer},
	type = {1},
	address = {Heidelberg},
	abstract = {Previous work on Quality of Service in Cut-through networks shows that resource reservation mechanisms are only effective below the saturation point. Admission control in these networks will therefore need to keep network utilization below the saturation point, while still utilising the network resources to the maximum extent possible. In this paper we propose and evaluate three admission control schemes. Two of these use a centralised bandwidth broker, while the third is a distributed measurement based approach. We combine these admission control schemes with a DiffServ based QoS scheme for virtual cut-through networks to achieve class based bandwidth and latency guarantees. Our simulations show that the measurement based approach favoured in the Internet communities performs poorly in cut-through networks. Furthermore it demonstrates that detailed knowledge on link utilization improves performance significantly.},
	author = {Reinemo, Sven-Arne and Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav},
	editor = {Timothy Mark {Pinkston} and Viktor K. {Prasanna}}
}
