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

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      03/01/20 02:20:20

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

Log message:
        Skip Graphs won't suite us. Instead, Kademlia + BitTorrent looks 
promising

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.19 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.20
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.19      Fri Jan 
17 09:09:27 2003
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Mon Jan 20 
02:20:20 2003
@@ -107,8 +107,12 @@
 +adaptive: doesn't need to know keyspace size before hand, instead of many 
DHTs, which require a priori knowledge about the size of the system or its 
keyspace
 +support for range queries, e.g. natural for version control: 'find latest 
news from yesterday', 'find largest key < news:12/12/2002', 'find all related 
objects nearby'
 (in DHTs this is a open problem)
-+There are not hotspots in skip graphs
++There are not hotspots in skip graphs (query/routing hotsports)
 -not network/geographical locality
+-for us purposes, Skip Graps could be used (sensible) only for block IDs, not 
for URNs: in Skip Graps, there have to be total order for data elements --> for 
URNs, there cannot be a total order
+-for range queries, we would have to use local sensitive hashing, *if* we want 
fetch blocks like 'next block = i + 1'. SHA-1 is a (secure) random hash of 
content (it won't help for us in this case) 
+
+
 
 See summary table for performance details