| Age | Commit message (Collapse) | Author |
|---|
|
leak?)
|
|
|
|
well supported or easily configurable anyway) -- this is really left over from the old collaborative multicast propagation algorithm. New algorithm (in for a while) has been sender-side replication in which sender "pays" all bandwidth, which intrinsically limits multicast.
|
|
full identity of peers instead of just address.
|
|
|
|
|
|
|
|
optimization to avoid repeated calls to _allMulticastGroups().
|
|
|
|
possibly other platforms) issue in Phy<>.
|
|
|
|
for consistency.
|
|
core, other bug fixes.
|
|
|
|
network request on network restore logic, and remember saved networks in service/One
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
out, redo COM serialization, etc.
|
|
|
|
|
|
disabled for older netconf servers to avoid race. Also add some comments.
|
|
|
|
|
|
|
|
we already have and have verified.
|
|
|
|
conditions, and add back rescan of multicast groups on network startup.
|
|
deadlock... the fact that this can happen is probably bad design.
|
|
|
|
bandwidth heavy, (2) add a little to default multicast rate limit since new MC algo is fairerererer, (3) decided not to involve netconf masters in multicast so take that out of list of who gets LIKEs.
|
|
of certificates of membership.
|
|
that differently, re-add support for active bridges, and remove some gratuitous use of std::set where not needed.
|
|
|
|
|
|
|
|
Network to remove redundant code and bug-proneness, more work on IncomingPacket...
|
|
|
|
|
|
|
|
|
|
|
