| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
pushing changes. Move path viability check to one place, and stop trying to use link-local addresses since they are not reliable.
|
|
rename addMembershipCertificate to more security-descriptive validateAndAddMembershipCertificate, give it a return value, and drop unused force parameter.
|
|
|
|
enumeration.
|
|
|
|
|
|
support code in Switch.
|
|
full identity of peers instead of just address.
|
|
|
|
|
|
allow RENDEZVOUS from regular peers.
|
|
significantly simpler way to move all of this logic entirely into the containing service, liberating the core from any concern over the nature of its pipe to the outside world.
|
|
assign different external IPs for each external destination. Keeping just one known surface could create a race condition.
|
|
|
|
|
|
possibly other platforms) issue in Phy<>.
|
|
|
|
|
|
for consistency.
|
|
avoid flooding.
|
|
|
|
|
|
scope.
|
|
|
|
trusted peers, and also rename ExternalSurface to SelfAwareness because lulz.
|
|
|
|
out, redo COM serialization, etc.
|
|
database confusion.
|
|
out of node/
|
|
|
|
remaining on the network.
|
|
disabled for older netconf servers to avoid race. Also add some comments.
|
|
|
|
|
|
|
|
|
|
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.
|
