+/* TODO : limiter link ? Loopback?
+ *
+ */
+
+class FatTreeNode {
+public:
+ int id; // ID as given by the user, should be unique
+ int level; // The 0th level represents the leafs of the PGFT
+ int position; // Position in the level
+
+ /* We can see the sizes sum of the two following vectors as the device
+ * ports number. If we use the notations used in Zahavi's paper,
+ * children.size() = m_level and parents.size() = w_(level+1)
+ *
+ */
+ std::vector<FatTreeNode*> children; // m, apply from lvl 0 to levels - 1
+ std::vector<FatTreeNode*> parents; // w, apply from lvl 1 to levels
+ FatTreeNode(int id, int level=-1, int position=-1);
+};
+
+class FatTreeLink {
+public:
+ FatTreeLink(sg_platf_cluster_cbarg_t cluster, FatTreeNode *source,
+ FatTreeNode *destination, unsigned int ports = 0);
+ unsigned int ports;
+ /* Links are dependant of the chosen network model, but must implement
+ * NetworkLink
+ */
+ std::vector<NetworkLink*> linksUp; // From source to destination
+ std::vector<NetworkLink*> linksDown; // From destination to source
+ /* As it is symetric, it might as well be first / second instead
+ * of source / destination
+ */
+ FatTreeNode *source;
+ FatTreeNode *destination;
+};