Testing KadoP Robustness

Testing KadoP Robustness

Task description

Testing KadoP robustness consists in checking the following:

• always get a response query (play with peers going down, going up: some keys get lost)
• run over the internet
• report lost messages

-> create a test suite for KadoP and see about exceptions not caught, see also hardcoded stuff.

Scenario:

• 100 peers, all of them with KadoP running
• indexed metadata from RPMs dblp.xml
• Test: remove a peer, check that the query returns the correct answer
• Test: add a peer, when you add a peer: you send a message to some peer in the peer. Are the queries ok, running?

At the beginning, only one peer has the data. The peer publishes the index: the index is split into small files. Then move this piece into this PeerID. based on the hash. The publisher asks the network to do the routing for him. If PeerID does not exist, the key is stored in another PeerID. Peers have an overlay address. These addresses are in a circle. Through a web service, the key is retrieved. KadoP also manages replication: if one peer disapears, the neighbours can serve the key.

The main problem is DHT key redistribution. Gabriel is doing it