[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/23 09:50:02

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

Log message:
        Updates to summary table

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.30 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.31
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.30      Thu Jan 
23 09:09:13 2003
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Thu Jan 23 
09:50:02 2003
@@ -146,13 +146,13 @@
 Pastry:        O(log^2 n)      O(log n)        O(log n)        (2^b - 1)(log 
n)/b 
 Tapestry:      O(log^2 n)      O(log n)        O(log n)        (2^b - 1)(log 
n)/b 
 Kademlia:      O(log n)*       O(log n)        O(log n)        2(log n)
-Viceroy:       O(log n)        O(1)            O(log n)        10
-SWAN 1):       O(1)            O(1)            O(log^2 n)      r(b+2l+2s) (r=# 
of resurces provided, b=boot, s=short, l=long), typical link conf: 6+2*7+2*8=36 
-Flooding:      O(1)            O(1)            O(n)**          typical conf: 
5, depends on implementation              
+Viceroy:       O(log n)        O(1)            O(log n)        11
+SWAN 1):       O(1)            O(1)            O(log^2 n)      r(2b+2s+2l) 
(r=# of resurces provided, b=boot, s=short, l=long), typical link conf: 
2*(6+7+8)=36 
+Flooding:      O(1)            O(1)            O(n)**          typical conf: 
5, depends on implementation --> 2*5=10 total             
 Social:                O(1)***         O(1)***         N/A***          can be 
1-10000 connections (aka social connections, connections are permament)
 Skip graphs 1): O(log n)       O(log n)        O(log n)        4r(log n) + 
(log n) (r=# of resurces provided)
-Symphony:      O(log^2 n)      O(log n)****    O(log n)        2k+2+f (k = 
long, 2 = node's neighbor, f = fault-tolerance links)
-Plaxton et al: not supported   O(log n)        O(log n)        2log n
+Symphony:      O(log^2 n)      O(log n)****    O(log n)        2k+2+f (k = 
long, 2 = node's neighbors, f = fault-tolerance links)
+Plaxton et al: not supported   O(log n)        O(log n)        2(log n)
 
 * = In Kademlia, there is no action required when nodes leaves the system