| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
cases we already know the identity and know it is valid
|
|
|
|
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.
|
|
supernodes.
|
|
|
|
ahead and keep track of total known peers.
|
|
|
|
|
|
since identities are what we really want to cache.
|
|
|
|
some more legacy multicast fixes.
|
|
|
|
nodes, and change netconf-master to issue multicast limit (ml) instead of old p5 stuff.
|
|
|
|
reinstate legacy support.
|
|
multicast for debugging purposes.
|
|
of certificates of membership.
|
|
|
|
frames in new way.
|
|
new frame to known-to-be-old peers.
|
|
|
|
|
|
|
|
AES256-GCM which might be added in the future.
|
|
|
|
handling.
|
|
|
|
Network to remove redundant code and bug-proneness, more work on IncomingPacket...
|
|
|
|
|
|
little more consistent about using _ to denote private member variables.
|
|
|
|
|
