1 /* Copyright (c) 2013-2016. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #ifndef SIMGRID_ROUTING_GENERIC_HPP_
7 #define SIMGRID_ROUTING_GENERIC_HPP_
9 #include "src/kernel/routing/NetZoneImpl.hpp"
15 /** @ingroup ROUTING_API
16 * @brief NetZone with an explicit routing (abstract class)
18 * This abstract class factorizes code between its subclasses: Full, Dijkstra and Floyd.
21 * <caption>Comparison of the RoutedZone subclasses</caption>
22 * <tr><td></td><td>DijkstraZone</td><td>FloydZone</td><td>FullZone</td></tr>
23 * <tr><td><b>Platform-file content</b></td>
24 * <td>Only 1-hop routes (rather small)</td>
25 * <td>Only 1-hop routes (rather small)</td>
26 * <td>Every path, explicitly (very large)</td>
28 * <tr><td><b>Initialization time</b></td>
29 * <td>Almost nothing</td>
30 * <td>Floyd-Warshall algorithm: O(n^3)</td>
31 * <td>Almost nothing</td>
33 * <tr><td><b>Memory usage</b></td>
34 * <td>1-hop routes (+ cache of routes)</td>
35 * <td>O(n^2) data (intermediate)</td>
36 * <td>O(n^2) + sum of path lengths (very large)</td>
38 * <tr><td><b>Lookup time</b></td>
39 * <td>Dijkstra Algo: O(n^3)</td>
40 * <td>not much (reconstruction phase)</td>
41 * <td>Almost nothing</td>
43 * <tr><td><b>Expressiveness</b></td>
44 * <td>Only shortest path</td>
45 * <td>Only shortest path</td>
51 class XBT_PRIVATE RoutedZone : public NetZoneImpl {
53 explicit RoutedZone(NetZone* father, const char* name);
55 void getGraph(xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) override;
56 virtual sg_platf_route_cbarg_t newExtendedRoute(RoutingMode hierarchy, sg_platf_route_cbarg_t routearg,
60 void getRouteCheckParams(NetPoint* src, NetPoint* dst);
61 void addRouteCheckParams(sg_platf_route_cbarg_t route);
68 XBT_PRIVATE xbt_node_t new_xbt_graph_node(xbt_graph_t graph, const char* name, xbt_dict_t nodes);
69 XBT_PRIVATE xbt_edge_t new_xbt_graph_edge(xbt_graph_t graph, xbt_node_t s, xbt_node_t d, xbt_dict_t edges);
72 #endif /* SIMGRID_ROUTING_GENERIC_HPP_ */