| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
is now good enough given the small number of legacy nodes left.
|
|
|
|
|
|
toggled.
|
|
|
|
|
|
|
|
|
|
This should not affect most users, but on large networks it should cause service
announcements to work a lot better. This is the result of a prolonged discussion
with a user about the visibility of game servers on a large network. The old
multicast algorithm was de-facto randomized due to its distributed nature, while
the new algorithm is more deterministic. This will restore some randomization
beyond limit-overflow conditions.
It won't affect small networks at all.
|
|
|
|
ahead and keep track of total known peers.
|
|
refactoring, and a few other things related to multicast.
|
|
command in testnet.
|
|
only one peer.
|
|
|
|
|
|
|
|
reinstate legacy support.
|
|
multicast for debugging purposes.
|
|
of certificates of membership.
|
|
new frame to known-to-be-old peers.
|
|
now. This will allow supernodes to echo these down to pre-1.0.0 peers.
|
|
that differently, re-add support for active bridges, and remove some gratuitous use of std::set where not needed.
|
|
least one supernode so they can broadcast to old peers (temporary).
|
|
Multicaster::gather().
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
controller but different code. More descriptive though.
|
|
|
|
|
|
well. Time for some more simulation before 0.5.0!
|
|
|
|
|
|
|
|
|
