Changes between Initial Version and Version 1 of Ticket #68, comment 11
- Timestamp:
- 2011-06-11T13:52:59Z (13 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Ticket #68, comment 11
initial v1 11 11 Fifth, tell each introducer to ''subscribe'' to the introducer-announcements of a small set of other introducers -- again choosing the Chord fingers -- and whenever the introducer hears announcements from the introducers that it subscribes to, then it announces those announcements themselves, just as if it had just heard them from a client. (Of course, it still ignores any announcements of nodes which it has previously announced, as above.) 12 12 13 Now the load of handling introductions is evenly spread among all introducers, and there is no Single Point of Failure/Single Point of Load.13 Now the load of handling introductions is evenly spread among all introducers, and there is no Single Point of !Failure/Single Point of Load. 14 14 15 15 Each introducer receives log(N) redundant announcements of each new node, where N is the total number of introducers in the system.