mirror of
https://github.com/monero-project/monero.git
synced 2024-12-16 02:44:27 -05:00
2fbbc4a2d3
Nodes remember which connections have been sent which peer addresses and won't send it again. This causes more addresses to be sent as the connection lifetime grows, since there is no duplication anymore, which increases the diffusion speed of peer addresses. The whole white list is now considered for sending, not just the most recent seen peers. This further hardens against topology discovery, though it will more readily send peers that have been last seen earlier than it otherwise would. While this does save a fair amount of net bandwidth, it makes heavy use of std::set lookups, which does bring network_address::less up the profile, though not too aggressively. |
||
---|---|---|
.. | ||
CMakeLists.txt | ||
net_node_common.h | ||
net_node.cpp | ||
net_node.h | ||
net_node.inl | ||
net_peerlist_boost_serialization.h | ||
net_peerlist.cpp | ||
net_peerlist.h | ||
p2p_protocol_defs.h | ||
stdafx.h |