281 |
n peers, O(log n) path length, all peers perform n lookups. Then the total |
n peers, O(log n) path length, all peers perform n lookups. Then the total |
282 |
number of packets is (n-1)((n-1)(log n)) |
number of packets is (n-1)((n-1)(log n)) |
283 |
|
|
284 |
|
n peers where fraction f are hostile, O(log n) path length, all peers |
285 |
|
perform n lookups. Then the total number of lost packets is |
286 |
|
[f^((log n)-1)]*[(n-1)((n-1)(log n))] |
287 |
|
|
288 |
|
|
289 |
.. No, you should not say "expect similar" - it's far too vague. |
.. No, you should not say "expect similar" - it's far too vague. |
290 |
You should make explicit statements as to what the results will |
You should make explicit statements as to what the results will |
291 |
be. |
be. |