1 /* Copyright (c) 2012-2018. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #ifndef _KADEMLIA_NODE_HPP
8 #define _KADEMLIA_NODE_HPP
10 #include "message.hpp"
11 #include "routing_table.hpp"
12 #include "s4u-dht-kademlia.hpp"
17 unsigned int id_; // node id - 160 bits
18 RoutingTable* table = nullptr; // node routing table
20 simgrid::s4u::CommPtr receive_comm;
21 void* received_msg = nullptr;
22 unsigned int find_node_success = 0; // Number of find_node which have succeeded.
23 unsigned int find_node_failed = 0; // Number of find_node which have failed.
24 explicit Node(unsigned int node_id) : id_(node_id), table(new RoutingTable(node_id)), receive_comm(nullptr) {}
25 Node(const Node&) = delete;
26 Node& operator=(const Node&) = delete;
27 ~Node() { delete table; }
28 unsigned int getId() { return id_; }
30 bool join(unsigned int known_id);
31 void sendFindNode(unsigned int id, unsigned int destination);
32 unsigned int sendFindNodeToBest(Answer* node_list);
33 void routingTableUpdate(unsigned int id);
34 Answer* findClosest(unsigned int destination_id);
35 bool findNode(unsigned int id_to_find, bool count_in_stats);
37 void handleFindNode(Message* msg);
40 // identifier functions
41 unsigned int get_id_in_prefix(unsigned int id, unsigned int prefix);
42 unsigned int get_node_prefix(unsigned int id, unsigned int nb_bits);
44 #endif /* _MSG_EXAMPLES_ROUTING_H */