1 /* Copyright (c) 2013-2021. 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_CLUSTER_HPP_
7 #define SIMGRID_ROUTING_CLUSTER_HPP_
9 #include <simgrid/kernel/routing/NetZoneImpl.hpp>
11 #include <unordered_map>
17 /** @ingroup ROUTING_API
18 * @brief NetZone where each component is connected through a private link
20 * Cluster zones have a collection of private links that interconnect their components.
21 * This is particularly well adapted to model a collection of elements interconnected
22 * through a hub or a through a switch.
24 * In a cluster, each component are given from 1 to 3 private links at creation:
25 * - Private link (mandatory): link connecting the component to the cluster core.
26 * - Limiter (optional): Additional link on the way from the component to the cluster core
27 * - Loopback (optional): non-shared link connecting the component to itself.
29 * Then, the cluster core may be constituted of a specific backbone link or not;
30 * A backbone can easily represent a network connected in a Hub.
31 * If you want to model a switch, either don't use a backbone at all,
32 * or use a fatpipe link (non-shared link) to represent the switch backplane.
37 * ======+====== <--backbone
39 * l0| l1| l2| l4| <-- private links + limiters
41 * X X X X <-- cluster's hosts
48 * / | \ <-- private links + limiters __________
55 * So, a communication from a host A to a host B goes through the following links (if they exist):
56 * <tt>limiter(A)_UP, private(A)_UP, backbone, private(B)_DOWN, limiter(B)_DOWN.</tt>
57 * link_UP and link_DOWN usually share the exact same characteristics, but their
58 * performance are not shared, to model the fact that TCP links are full-duplex.
60 * A cluster is connected to the outer world through a router that is connected
61 * directly to the cluster's backbone (no private link).
63 * A communication from a host A to the outer world goes through the following links:
64 * <tt>limiter(A)_UP, private(A)_UP, backbone</tt>
65 * (because the private router is directly connected to the cluster core).
68 class ClusterZone : public NetZoneImpl {
69 /* We use a map instead of a std::vector here because that's a sparse vector. Some values may not exist */
70 /* The pair is {link_up, link_down} */
71 std::unordered_map<unsigned int, std::pair<resource::LinkImpl*, resource::LinkImpl*>> private_links_;
72 std::unordered_map<unsigned int, NetPoint*> gateways_; //!< list of gateways for leafs (if they're netzones)
73 resource::LinkImpl* backbone_ = nullptr;
74 NetPoint* router_ = nullptr;
75 bool has_limiter_ = false;
76 bool has_loopback_ = false;
77 unsigned int num_links_per_node_ = 1; /* may be 1 (if only a private link), 2 or 3 (if limiter and loopback) */
80 void set_num_links_per_node(unsigned int num) { num_links_per_node_ = num; }
81 resource::LinkImpl* get_uplink_from(unsigned int position) const { return private_links_.at(position).first; }
82 resource::LinkImpl* get_downlink_to(unsigned int position) const { return private_links_.at(position).second; }
85 explicit ClusterZone(const std::string& name);
88 bool has_loopback() const { return has_loopback_; }
90 bool has_limiter() const { return has_limiter_; }
91 void set_backbone(resource::LinkImpl* bb) { backbone_ = bb; }
92 bool has_backbone() const { return backbone_ != nullptr; }
93 void set_router(NetPoint* router) { router_ = router; }
94 /** @brief Sets gateway for the leaf */
95 void set_gateway(unsigned int position, NetPoint* gateway);
96 /** @brief Gets gateway for the leaf or nullptr */
97 NetPoint* get_gateway(unsigned int position);
98 void add_private_link_at(unsigned int position, std::pair<resource::LinkImpl*, resource::LinkImpl*> link);
99 bool private_link_exists_at(unsigned int position) const
101 return private_links_.find(position) != private_links_.end();
104 void get_local_route(NetPoint* src, NetPoint* dst, RouteCreationArgs* into, double* latency) override;
105 void get_graph(const s_xbt_graph_t* graph, std::map<std::string, xbt_node_t, std::less<>>* nodes,
106 std::map<std::string, xbt_edge_t, std::less<>>* edges) override;
108 virtual void create_links_for_node(ClusterCreationArgs* cluster, int id, int rank, unsigned int position);
109 virtual void parse_specific_arguments(ClusterCreationArgs*)
111 /* this routing method does not require any specific argument */
114 unsigned int node_pos(int id) const { return id * num_links_per_node_; }
115 unsigned int node_pos_with_loopback(int id) const { return node_pos(id) + (has_loopback_ ? 1 : 0); }
116 unsigned int node_pos_with_loopback_limiter(int id) const
118 return node_pos_with_loopback(id) + (has_limiter_ ? 1 : 0);
120 /** Fill the leaf retriving netpoint from a user's callback */
121 void fill_leaf_from_cb(unsigned int position, const std::vector<unsigned int>& dimensions,
122 const std::function<s4u::ClusterNetPointCb>& set_netpoint_cb,
123 const std::function<s4u::ClusterLinkCb>& set_loopback_cb,
124 const std::function<s4u::ClusterLinkCb>& set_limiter_cb, NetPoint** node_netpoint,
125 s4u::Link** lb_link, s4u::Link** limiter_link);
127 } // namespace routing
128 } // namespace kernel
129 } // namespace simgrid
131 #endif /* SIMGRID_ROUTING_CLUSTER_HPP_ */