Kademlia is a distributed hash table for decentralized peer-to-peer computer networks designed by Petar Maymounkov and David Mazières in 2002.[1][2] It specifies the structure of the network and the exchange of information through node lookups. Kademlia nodes communicate among themselves using UDP. A virtual or overlay network is formed by the participant nodes. Each node is identified by a number or node ID. The node ID serves not only as identification, but the Kademlia algorithm uses the node ID to locate values (usually file hashes or keywords).
In order to look up the value associated with a given key, the algorithm explores the network in several steps. Each step will find nodes that are closer to the key until the contacted node returns the value or no more closer nodes are found. This is very efficient: like many other DHTs, Kademlia contacts only nodes during the search out of a total of nodes in the system.
Further advantages are found particularly in the decentralized structure, which increases the resistance against a denial-of-service attack. Even if a whole set of nodes is flooded, this will have limited effect on network availability, since the network will recover itself by knitting the network around these "holes".
I2P's implementation of Kademlia is modified to mitigate Kademlia's vulnerabilities, such as Sybil attacks.[3]
^Maymounkov, Petar; Mazieres, David. "Kademlia: A Peer-to-peer Information System Based on the XOR Metric" (PDF). pdos.csail.mit.edu. Retrieved 2023-12-28.
^"Papers by David Mazières". www.scs.stanford.edu.
Kademlia is a distributed hash table for decentralized peer-to-peer computer networks designed by Petar Maymounkov and David Mazières in 2002. It specifies...
Mainline DHT is the name given to the Kademlia-based distributed hash table (DHT) used by BitTorrent clients to find peers via the BitTorrent protocol...
The Kad network is a peer-to-peer (P2P) network which implements the Kademlia P2P overlay protocol. The majority of users on the Kad Network are also connected...
used by BitTorrent (based on Kademlia as provided by Khashmir) Content addressable network (CAN) Chord Koorde Kademlia Pastry P-Grid Riak ScyllaDB Tapestry...
includes a distributed hash table (DHT) which is a randomized variant of Kademlia that can still efficiently route in small-world networks. GNUnet offers...
file sharing. In contrast to other eDonkey clients, iMule only uses the Kademlia for proceeding to connect through I2P network, so no servers are needed...
compatibility with Mainline DHT. Both DHT implementations are based on Kademlia. As of version 3.0.5.0, Vuze also supports Mainline DHT in addition to...
Sybil-resistant distributed hash table algorithm. I2P's implementation of Kademlia also has provisions to mitigate Sybil attacks. Astroturfing Ballot stuffing...
protocols based on UDP/IP include: Distributed hash tables (DHTs) based on Kademlia algorithm, such as KAD, etc. Real Time Media Flow Protocol – Adobe Flash...
support for the Kad network. This network has an implementation of the Kademlia protocol, which does not rely on central servers as the eDonkey network...
versions and renamed to "Torrent Exchange" since v.1.17. BitComet uses the Kademlia (mainline) DHT to operate even when the tracker is offline. BitComet is...
successor to the eDonkey protocol. The eMule Project also developed a Kademlia network of their own (called Kad) to overcome the reliance on central servers...
Global Information
