Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
By Petar Maymounkov, David Mazières. International Workshop on Peer-to-Peer Systems, 2002
3,652 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/eb51cb223fb17995085af86ac70f765077720504
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Peter Druschel
- Ion Stoica
- John Risson
- Tim Moors
- John D. Kubiatowicz
- D. Wallach
- Antony Ian Taylor Rowstron
- Robert Morris
Citations in the corpus
- Understanding Availability (2003, background): “, [4, 9], assume that this happens with very low probability, failing which, objects stored in the system could be lost forever.”
- A Survey on Ethereum Systems Security (2019, methodology): “Recall that the Ethereum P2P network uses a modified Kademlia DHT [97] for node discovery and that each node maintains a routing table of 256 buckets for storing information about the other nodes.”
- Network Coordinates in the Wild (2007, background): “Azureus uses Kademlia, which defines the logical distance between two DHT keys as the exclusive-or of their bits [19].”
- Vanish: Increasing Data Privacy with Self-Destructing Data (2009, methodology): “Azureus) DHT is based on the Kademlia [35] protocol.”
- IPFS - Content Addressed, Versioned, P2P File System (2014, background): “DSHTs called clusters depending on region and size.”
- Herbivore: A Scalable and Efficient Protocol for Anonymous Communication (2003, background): “Indeed, many peer-to-peer systems use the hash of an IP address and a small salt (between zero and eight bits) to map the physical participants onto a virtual ring [15, 18, 21, 10, 9].”
- Cooperative Security for Network Coding File Distribution (2006, background): “In this paper we do not consider such types of attacks, which often require a more distributed peer-discovery protocol [34], [45].”
- BotMiner: Clustering Analysis of Network Traffic for Protocol- and Structure-Independent Botnet Detection (2008, methodology): “It is based on the Kademlia [30] protocol and makes use of the Overnet network [2] to locate related data (e.g., commands).”
- Peer-to-Peer Botnets: Overview and Case Study (2007, methodology): “For a more detailed discussion of Kademlia, see [ 4 ].”
- BotGrep: Finding P2P Bots with Structured Graph Analysis (2010, background): “…provided by structured networks, both due to their advantages in terms of efficiency and resilience, and due to easy availability of well-tested implementations of the structured P2P algorithms (e.g., Storm bases the C&C structure for its supernodes on the Overnet implementation of Kademlia [50]).”
- On-the-fly verification of rateless erasure codes for efficient content distribution (2004, background): “, Chord [26], Pastry [24], and Kademlia [13]).”
- The socialbot network: when bots socialize for fame and money (2011, neutral): “, Chord [60], Kademlia [43]).”
- Tapestry: a resilient global-scale overlay for service deployment (2004, neutral): “Recent works include systems such as Kademlia [9], which uses XOR for overlay routing, and Viceroy [10], which provides logarithmic hops through nodes with constant degree routing tables.”