1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
/* Copyright (c) 2012-2025. The SimGrid Team. All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
#ifndef KADEMLIA_NODE_HPP
#define KADEMLIA_NODE_HPP
#include "routing_table.hpp"
#include "s4u-dht-kademlia.hpp"
#include <memory>
namespace kademlia {
class Node {
unsigned int id_; // node id - 160 bits
RoutingTable table; // node routing table
unsigned int find_node_success = 0; // Number of find_node which have succeeded.
unsigned int find_node_failed = 0; // Number of find_node which have failed.
simgrid::s4u::CommPtr receive_comm = nullptr;
Message* received_msg = nullptr;
public:
explicit Node(unsigned int node_id) : id_(node_id), table(node_id) {}
Node(const Node&) = delete;
Node& operator=(const Node&) = delete;
unsigned int getId() const { return id_; }
Message* receive(simgrid::s4u::Mailbox* mailbox);
bool join(unsigned int known_id);
void sendFindNode(unsigned int id, unsigned int destination) const;
unsigned int sendFindNodeToBest(const Answer* node_list) const;
void routingTableUpdate(unsigned int id);
std::unique_ptr<Answer> findClosest(unsigned int destination_id);
bool findNode(unsigned int id_to_find, bool count_in_stats);
void randomLookup();
void handleFindNode(const Message* msg);
void displaySuccessRate() const;
};
} // namespace kademlia
// identifier functions
unsigned int get_id_in_prefix(unsigned int id, unsigned int prefix);
unsigned int get_node_prefix(unsigned int id, unsigned int nb_bits);
#endif /* KADEMLIA_NODE_HPP */
|
