@inproceedings {Reinemo.2007.1,
	title = {Boosting Ethernet Performance by Segment-Based Routing},
	journal = {Proceedings of the 15th Euromicro Conference on Parallel, Distributed and Network-based Processing (PDP 2007)},
	year = {2007},
	month = {February},
	pages = {55-62},
	publisher = {IEEE Computer Society Press},
	type = {Conference},
	abstract = {In this paper we embed an efficient topology agnostic routing algorithm with fault tolerance capabilities into back-pressured Ethernet technology. This makes it possible to use off-the-shelf equipment to build cost-effective systems with an efficient use of all network components. This stands in contrast to the inefficient use of network resources (links) supported by the Spanning Tree Protocol (STP). The Segment-Based Routing Algorithm (SR) is a deterministic routing algorithm that achieves high performance without the use of virtual channels. Furthermore, it is topology agnostic, meaning it can handle any topology and any combination of faults derived from the original topology when combined with static reconfiguration. Through simulations we verify an overall improvement in throughput by a factor of 1.2 to 10.0 compared to the conventional Ethernet routing algorithm, the STP, and other topology agnostic routing algorithms such as Up*/Down* and Tree-based Turn-prohibition, which both are applicable to Ethernet.},
	isbn = {0-7695-2784-1},
	author = {Reinemo, Sven-Arne and Skeie, Tor and Mej{\'\i}a, Andres and Flich, Jos{\'e} and Duato, Jose},
	editor = {D{\textquoteright}Ambra, Pasqua and Mario Rosario {Guarracino}}
}
