wiki:gsoc/ideas/router/dht_kad

Version 2 (modified by welterde, 10 years ago) (diff)

--

Revive Kademlia DHT

Peers in I2P currently 'discover' each other through a floodfill system (several high-traffic routers inform the other routers of each other). This system is not as scalable as a DHT system, and it's also less secure (because of the reliance on a limited number of nodes). Changing this system or replacing it, will be an interesting and challenging task.

Status

open

Difficulty

difficult

Required skills

  • Java
  • Good knowledge of networking protocols, network routing ...
  • Willingness to learn about different types of Distributed Hash Tables and research how well they would fit into the I2P network

Notes

  • There is already a Kademlia implementation in I2P that used to work, but it was abandoned for a floodfill implementation due to the Kademlia system not working efficiently enough.