239 |
and "QUERY" messages are part of GISP-3.4 specification. Also, |
and "QUERY" messages are part of GISP-3.4 specification. Also, |
240 |
a hostile peer is able to use this "dumb" behaviour with other GISP-3.4 |
a hostile peer is able to use this "dumb" behaviour with other GISP-3.4 |
241 |
messages. |
messages. |
242 |
|
|
243 |
|
- In the GISP overlay, the average routing hop length is proportional to |
244 |
|
O(log n). |
245 |
|
|
246 |
|
- In a GISP network, when fraction f of the peers are "dumb" and a "dumb" |
247 |
|
peer do not provide a "RESULT" message for a "QUERY" message, the |
248 |
|
probability of routing successfully "QUERY" message between two regular |
249 |
|
peers is (1-f)^h-1, where h is the routing hops used in the overlay. |
250 |
|
|
251 |
|
|
252 |
|
|
253 |
|
- - - |
254 |
|
|
255 |
- It is expected that (popular) data items can be found with fewer hops in |
- It is expected that (popular) data items can be found with fewer hops in |
256 |
*some cases* in GISP network w.r.t Chord network, since GISP extends Chord's |
*some cases* in GISP network w.r.t Chord network, since GISP extends Chord's |
272 |
not process or forward queries at all |
not process or forward queries at all |
273 |
|
|
274 |
.. more specific, create a formula (?) |
.. more specific, create a formula (?) |
275 |
|
|
|
|
|
276 |
If fraction f of the peers are dumb in a static network with 10 - 10000 |
If fraction f of the peers are dumb in a static network with 10 - 10000 |
277 |
peer and fraction f of the lookups, then fraction of the lookups will |
peer and fraction f of the lookups, then fraction of the lookups will |
278 |
fail at all network sizes |
fail at all network sizes |