254 |
a static GISP network since the current GISP implementation do not handle |
a static GISP network since the current GISP implementation do not handle |
255 |
"dumb" peers properly. More specifically, if there are n peers and fraction |
"dumb" peers properly. More specifically, if there are n peers and fraction |
256 |
f are "dumb" (i.e., do not process regular messages, replies only to "SEEN" |
f are "dumb" (i.e., do not process regular messages, replies only to "SEEN" |
257 |
messages), the overlay has O(log n) average path length and all |
messages), the overlay has O(log n) average path length and all n |
258 |
peers perform n-1 lookups (i.e., worst case: have to lookup every other peer |
peers perform n-1 lookups, then the estimated total number of lost packets is |
|
in the network), then the estimated total number of lost packets is |
|
259 |
[f^((log n)-1)]*[n((n-1)(log n))]. |
[f^((log n)-1)]*[n((n-1)(log n))]. |
260 |
|
|
261 |
|
|
283 |
|
|
284 |
Notes: |
Notes: |
285 |
|
|
286 |
n peers, O(log n) path length, all peers perform n-1 lookups (i.e., worst |
n peers, O(log n) path length, all peers perform n-1 lookups. Then the |
287 |
case: have to lookup every other peer). Then the total number of packets |
total number of packets is n((n-1)(log n)) |
|
is n((n-1)(log n)) |
|
288 |
|
|
289 |
n peers, O(log n) path length, random fraction of peers, r, perform rl |
n peers, O(log n) path length, random fraction of peers, r, perform rl |
290 |
lookups. Then the total number of packets is r((rl)(log n)) |
lookups. Then the total number of packets is r((rl)(log n)) |
291 |
|
|
292 |
GISP network: n peers, O(log n) path length, all peers perform n-1 lookups |
GISP network: n peers, O(log n) path length, all peers perform n-1 lookups. |
293 |
(i.e., worst case: have to lookup every other peer). Then the total number |
Then the total number of packets is n((n-1)(log n)) |
|
of packets is n((n-1)(log n)) |
|
294 |
|
|
295 |
n peers where fraction f are hostile, O(log n) path length, all peers |
n peers where fraction f are hostile, O(log n) path length, all peers |
296 |
perform n-1 lookups (i.e., worst case: have to lookup every other peer). Then |
perform n-1 lookups. Then the total number of lost packets is |
297 |
the total number of lost packets is [f^((log n)-1)]*[n((n-1)(log n))] |
[f^((log n)-1)]*[n((n-1)(log n))] |
298 |
|
|
299 |
|
|
300 |
.. No, you should not say "expect similar" - it's far too vague. |
.. No, you should not say "expect similar" - it's far too vague. |