X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/a79a8e1cab86ccc687cfbc97b01b735acb996f16..9cca09ad88fcaeb49f2637de97df519c3920aaa4:/src/kernel/routing/RoutedZone.hpp diff --git a/src/kernel/routing/RoutedZone.hpp b/src/kernel/routing/RoutedZone.hpp index 8db82e1f02..74e655bc30 100644 --- a/src/kernel/routing/RoutedZone.hpp +++ b/src/kernel/routing/RoutedZone.hpp @@ -1,4 +1,4 @@ -/* Copyright (c) 2013-2016. The SimGrid Team. All rights reserved. */ +/* Copyright (c) 2013-2017. The SimGrid Team. All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ @@ -12,20 +12,61 @@ namespace simgrid { namespace kernel { namespace routing { +/** @ingroup ROUTING_API + * @brief NetZone with an explicit routing (abstract class) + * + * This abstract class factorizes code between its subclasses: Full, Dijkstra and Floyd. + * + *
DijkstraZone | FloydZone | FullZone | |
Platform-file content | + *Only 1-hop routes (rather small) | + *Only 1-hop routes (rather small) | + *Every path, explicitly (very large) | + *
Initialization time | + *Almost nothing | + *Floyd-Warshall algorithm: O(n^3) | + *Almost nothing | + *
Memory usage | + *1-hop routes (+ cache of routes) | + *O(n^2) data (intermediate) | + *O(n^2) + sum of path lengths (very large) | + *
Lookup time | + *Dijkstra Algo: O(n^3) | + *not much (reconstruction phase) | + *Almost nothing | + *
Expressiveness | + *Only shortest path | + *Only shortest path | + *Everything | + *