10 | 10 | * Failing nodes or links change the underlying topology and this needs to be reflected when determining some statistics as, e.g., the stretch. Whereas the shortest path matrix may be precalculated in static environments, this is not possible in the dynamic case but the. As oftentimes not any-to-any connectivity but only a sampling set of node pairs is examined, RoutingSim supports '''on-demand calculation of such metrics''' for only the sampled node pairs. While RoutingSim takes care of the topology management, the efficient and mature [http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/index.html Boost Graph Library] data structures and graph algorithms are used to, e.g., to determine connectivity or shortest paths. |