278 |
fraction of f all peers become "dumb", same fraction f of all lookups will |
fraction of f all peers become "dumb", same fraction f of all lookups will |
279 |
fail. |
fail. |
280 |
|
|
281 |
|
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)) |
283 |
|
|
284 |
.. No, you should not say "expect similar" - it's far too vague. |
.. No, you should not say "expect similar" - it's far too vague. |
285 |
You should make explicit statements as to what the results will |
You should make explicit statements as to what the results will |