M1.
Network formation. [5p]. Your nodes must be able to form networks as described in the Kademlia paper. Kademlia is a protocol for facilitating Distributed Hash Tables (DHTs). Concretely, the following aspects of the algorithm must be implemented:
(c) Node lookup. When part of a network, each node must be able to retrieve the contact
information of any other node in the same network.
M1. Network formation. [5p]. Your nodes must be able to form networks as described in the Kademlia paper. Kademlia is a protocol for facilitating Distributed Hash Tables (DHTs). Concretely, the following aspects of the algorithm must be implemented: (c) Node lookup. When part of a network, each node must be able to retrieve the contact information of any other node in the same network.