190 |
Skip graphs 1): O(log n) O(log n) O(log n) 4r(log n) + (log n) (r=# of resurces provided) |
Skip graphs 1): O(log n) O(log n) O(log n) 4r(log n) + (log n) (r=# of resurces provided) |
191 |
SkipNet: O(log n) O(log n) O(log n) 2(log n) |
SkipNet: O(log n) O(log n) O(log n) 2(log n) |
192 |
Symphony: O(log^2 n) O(log n)**** O(log n) 2k+2+f (k = long, 2 = node's neighbors, f = fault-tolerance links) |
Symphony: O(log^2 n) O(log n)**** O(log n) 2k+2+f (k = long, 2 = node's neighbors, f = fault-tolerance links) |
193 |
ODHDHT 2): O(log n) O(log n) O(log n)/O(log^2 n) 2(log n) |
ODHDHT 2): O(log n) O(log n) O(log n) 2(log n) |
194 |
Plaxton et al 3): not supported O(log n) O(log n) 2(log n) |
Plaxton et al 3): not supported O(log n) O(log n) 2(log n) |
195 |
PeerNet 4): O(log n) O(log n) O(log n) O(log n) |
PeerNet 4): O(log n) O(log n) O(log n) O(log n) |
196 |
Kelips: ***** O(sqrt(n)) O(1) n/sqrt(n) + c*(sqrt(n)-1) + 'Total number of files'/sqrt(n) |
Kelips: ***** O(sqrt(n)) O(1) n/sqrt(n) + c*(sqrt(n)-1) + 'Total number of files'/sqrt(n) |
346 |
|
|
347 |
**** = Can be also O(1). Additional space of 'space^2' can be used as a lookahed list for better performance |
**** = Can be also O(1). Additional space of 'space^2' can be used as a lookahed list for better performance |
348 |
|
|
349 |
***** = constant background overhead is: O(2(sqrt(n)*(log^2 n)) + (sqrt(n) + (log^3 n))) (which includes convergence times for insertion/deletion of node) |
***** = Constant background overhead is: O(2(sqrt(n)*(log^2 n)) + (sqrt(n) + (log^3 n))) (which includes convergence times for insertion/deletion of node) |
350 |
|
|
351 |
|
|
352 |
1) = In these approaches, node is treated as 'named resource'; in this approach, *resources* self-organise (opposite to DHTs). |
1) = In these approaches, node is treated as 'named resource'; in this approach, *resources* self-organise (opposite to DHTs). |