[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/17 05:05:53

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

Log message:
        Skip graphs: delete too optimistic comment ;)

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.16 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.17
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.16      Thu Jan 
16 07:21:30 2003
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Fri Jan 17 
05:05:53 2003
@@ -100,8 +100,7 @@
 1.6. Skip Graphs (based on skip lists)
 +fast routing (aka searching)
 +scalable
-+little network traffic
-+possibly, the best solution for our needs
++little network traffic (however, more than DHTs)
 +support *data* locality, opposite to DHTs where data is spread out evenly, 
destroying locality. In skip graphs, hashing is not requires, only *keys* 
matters (which we already have)
 +support for partial repair mechanism/self-stabilization (DHTs lack of repair 
mechanism/self-stabilization)
 +the most robust algorithm up to date, tolerance of adversial faults (DHTs 
support only of random faults)