[Gzz-commits] gzz/Documentation/misc/hemppah-progradu existin...

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      02/11/07 03:32:04

Modified files:
        Documentation/misc/hemppah-progradu: existing_systems_overview 

Log message:
        Added some text about Kademlia

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/existing_systems_overview.diff?tr1=1.5&tr2=1.6&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/existing_systems_overview
diff -u gzz/Documentation/misc/hemppah-progradu/existing_systems_overview:1.5 
gzz/Documentation/misc/hemppah-progradu/existing_systems_overview:1.6
--- gzz/Documentation/misc/hemppah-progradu/existing_systems_overview:1.5       
Thu Nov  7 03:25:49 2002
+++ gzz/Documentation/misc/hemppah-progradu/existing_systems_overview   Thu Nov 
 7 03:32:03 2002
@@ -117,6 +117,27 @@
 -Content Hash Key (CHK), Keyword Signed Key (KSK), Signature
 Verification Key (SVK)
 
+2.5. Kademlia
+-Overnet and eDonkey2000 are based on Kademlia
+
+-(From the project's web page) 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.
+
+
+-The uniform design of KADEMLIA's routing table (a binary tree of contact 
buckets, see Springer-Verlag LNCS 
+paper for more details) allows to naturally accommodate even temporarily used 
contacts. More specifically, in 
+the process of a lookup a node gets to use some helper contacts that don't 
really belong to its routing table 
+since they will, on average, be far from the node's ID. However, KADEMLIA's 
routoing table can still 
+accommodate them temporarily in the appropriate branch of its binary tree 
(expanding the tree a bit if necessary) 
+and so make them accessible to other concurrent lookups that might benefit 
from them. In a situation, when a the 
+system is busy and there are a number of simultaneously happening lookups, 
this can shorten the number of hops per 
+lookup substantially. The above enhancment cannot be implemented in a natural 
way in any of the well-known DHTs 
+(distributed hash tables) such as Chord, Pastry, Tapestry, etc. since the 
design of their routing tables allows 
+for no such flexibility, and hence they would require additional data 
structures to accommodate temporary contacts.
+ 
+
 
 3. Different architectures for p2p networks: