KADEMLIA is a novel routing algorithm for peer-to-peer networks based on the XOR metric. The KADEMLIA project is a research effort to implement a full-featured peer-to-peer system based on the XOR metric routing. Topics of interest are efficient data storage and query; anonimity; network, content and user security and authentication. Currently, we are working on a Java implementation of KADEMLIA.
| Attributes | Values |
|---|
| rdfs:label
| |
| rdfs:comment
| - KADEMLIA is a novel routing algorithm for peer-to-peer networks based on the XOR metric. The KADEMLIA project is a research effort to implement a full-featured peer-to-peer system based on the XOR metric routing. Topics of interest are efficient data storage and query; anonimity; network, content and user security and authentication. Currently, we are working on a Java implementation of KADEMLIA.
- Kademlia is a distributed hash table for decentralized peer to peer computer networks designed by Petar Maymounkov and David Mazières . 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 fact, the node ID provides a direct map to file hashes and that node stores information on where to obtain the file or resource.
|
| sameAs
| |
| dcterms:subject
| |
| dbkwik:freespeech/...iPageUsesTemplate
| |
| abstract
| - KADEMLIA is a novel routing algorithm for peer-to-peer networks based on the XOR metric. The KADEMLIA project is a research effort to implement a full-featured peer-to-peer system based on the XOR metric routing. Topics of interest are efficient data storage and query; anonimity; network, content and user security and authentication. Currently, we are working on a Java implementation of KADEMLIA.
- Kademlia is a distributed hash table for decentralized peer to peer computer networks designed by Petar Maymounkov and David Mazières . 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 fact, the node ID provides a direct map to file hashes and that node stores information on where to obtain the file or resource. When searching for some value, the algorithm needs to know the associated key and 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 (see Big O notation) nodes during the search out of a total of nodes in the system. Further advantages are found particularly in the decentralized structure, which clearly 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, which will recover itself by knitting the network around these "holes".
|
![[RDF Data]](/fct/images/sw-rdf-blue.png)