ORCS: An Oblivious Routing Congestion Simulator
Source: Indiana University
Bisection Bandwidth, as defined by Hennessy and Patterson in as the bandwidth between the two equal sized halves of the network for the worst case partition, is widely used as a theoretical model for network performance. This model gives an upper bound for the minimal bisection bandwidth, as experienced by applications, of a network, as it does not take the used routing scheme into account. It has been proven that oblivious static routing, where there is one fixed path through the network for each (source, destination) pair, is suboptimal for various network topologies. However, oblivious routing is easy to implement and delivers low latencies because no computation is needed to route packets, since the routes can be determined off-line.