117 |
-Content Hash Key (CHK), Keyword Signed Key (KSK), Signature |
-Content Hash Key (CHK), Keyword Signed Key (KSK), Signature |
118 |
Verification Key (SVK) |
Verification Key (SVK) |
119 |
|
|
120 |
|
2.5. Kademlia |
121 |
|
-Overnet and eDonkey2000 are based on Kademlia |
122 |
|
|
123 |
|
-(From the project's web page) KADEMLIA is a novel routing algorithm for peer-to-peer networks based on the XOR metric. |
124 |
|
The KADEMLIA project is a research effort to implement a full-featured peer-to-peer system based |
125 |
|
on the XOR metric routing. Topics of interest are efficient data storage and query; anonimity; network, |
126 |
|
content and user security and authentication. Currently, we are working on a Java implementation of KADEMLIA. |
127 |
|
|
128 |
|
|
129 |
|
-The uniform design of KADEMLIA's routing table (a binary tree of contact buckets, see Springer-Verlag LNCS |
130 |
|
paper for more details) allows to naturally accommodate even temporarily used contacts. More specifically, in |
131 |
|
the process of a lookup a node gets to use some helper contacts that don't really belong to its routing table |
132 |
|
since they will, on average, be far from the node's ID. However, KADEMLIA's routoing table can still |
133 |
|
accommodate them temporarily in the appropriate branch of its binary tree (expanding the tree a bit if necessary) |
134 |
|
and so make them accessible to other concurrent lookups that might benefit from them. In a situation, when a the |
135 |
|
system is busy and there are a number of simultaneously happening lookups, this can shorten the number of hops per |
136 |
|
lookup substantially. The above enhancment cannot be implemented in a natural way in any of the well-known DHTs |
137 |
|
(distributed hash tables) such as Chord, Pastry, Tapestry, etc. since the design of their routing tables allows |
138 |
|
for no such flexibility, and hence they would require additional data structures to accommodate temporary contacts. |
139 |
|
|
140 |
|
|
141 |
|
|
142 |
3. Different architectures for p2p networks: |
3. Different architectures for p2p networks: |
143 |
|
|