The League of Routing Algorithms

This interface offers an easy and interactive visualization of complete datasets obtained from the performance evaluation of state-of-the-art and newly proposed routing algorithms.

About »

CSP Algorithms

Evaluation of state-of-the-art CSP algorithms

Performance evaluation of 19 state-of-the-art unicast constrained shortest path (CSP) algorithms. The runtime and optimality gap of the algorithms is evaluated for different topologies, topology sizes and for different tightness levels of the constraint bound.

Go »

Bounded Dijkstra (BD)

Search space reduction for Dijkstra

When used as a subroutine of another algorithm, Dijkstra can often be stopped earlier if paths become too long. We show that this improvement allows to reduce the runtime of some algorithms by 75% in average.

Go »