1 /* Copyright (c) 2012-2020. 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; // node routing table
19 unsigned int find_node_success = 0; // Number of find_node which have succeeded.
20 unsigned int find_node_failed = 0; // Number of find_node which have failed.
22 simgrid::s4u::CommPtr receive_comm = nullptr;
23 void* received_msg = nullptr;
24 explicit Node(unsigned int node_id) : id_(node_id), table(node_id) {}
25 Node(const Node&) = delete;
26 Node& operator=(const Node&) = delete;
27 unsigned int getId() const { return id_; }
29 bool join(unsigned int known_id);
30 void sendFindNode(unsigned int id, unsigned int destination) const;
31 unsigned int sendFindNodeToBest(const Answer* node_list) const;
32 void routingTableUpdate(unsigned int id);
33 Answer* findClosest(unsigned int destination_id);
34 bool findNode(unsigned int id_to_find, bool count_in_stats);
36 void handleFindNode(const Message* msg);
37 void displaySuccessRate() const;
39 } // namespace kademlia
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 /* KADEMLIA_NODE_HPP */