progettazione e realizzazione in java di una rete peer to peer ...

Appendice A
Documentazione del progetto
A.1 Kademlia
This document describes our Kademlia implementation. This client is intended
to run over a connectivity layer allowing high scalability and high modularization.
Byte arrays moving between the Kademlia layer and connectivity layer are mana-
ged by a simple monitor. Kademlia, as described in [1], uses four logic RPC and
several ADT that store information about the net around a node. A description
of the implementation of the four RPC follows. We explain choices and policies
and finally most important pieces of code.
The main class of the package is KadAdt that provides all the primary low
level methods to operate on the basic structure of Kademlia. Besides this object
other threads maintain data consistency and the node running 1 .
We analyze the whole package keeping in mind how it works, giving a tran-
sversal view of the involved classes.
A.1.1 ADT
In a Kademlia client there are three different main data structures.
1. the table of buckets;
2. the table of random bytes;
3. the table of store:
• the table of internal store;
• the table of external store.
1 Accepting new incoming connection.
39