83 |
- O(log^2 n) messages are required to join/leave operations |
- O(log^2 n) messages are required to join/leave operations |
84 |
- O(log n) lookup efficiency |
- O(log n) lookup efficiency |
85 |
- Routing table maintains information about O(log n) peers |
- Routing table maintains information about O(log n) peers |
86 |
|
- Routing table requires information about O(log n) of other peers |
87 |
|
of *efficient* routing, but performance degrades gracefully |
88 |
|
when that information is out of date |
89 |
|
- Only one piece of information per peer need to be corect in |
90 |
|
order to guarantee correct (though slow) routing queries |
91 |
- Requires active stabilization protocol to aggressively maintain |
- Requires active stabilization protocol to aggressively maintain |
92 |
the routing tables of all peers |
the routing tables of all peers |
93 |
- Has no specific mechanism to heal partitioned peer groups |
- Has no specific mechanism to heal partitioned peer groups |
94 |
|
|
95 |
The assumption for the results above is that the system is "in the steady state", |
The assumption for the results above is that the system is "in the steady state", |