-
- Downloads
routing_table: complete connecting state resolution
After a connectivity change, the DHT would enter the "connecting" state in order to try to resolve good nodes. However, the previous algorithm would probabilistically increase time for completion each time a node would fail to resolve. We now avoid this by prioritizing non-expired nodes in the process. Also, a subtle error would sensibly stop the process for 30 minutes due to using the Node::NODE_EXPIRE_TIME constant instead of Node::MAX_RESPONSE_TIME.
Showing
- include/opendht/callbacks.h 1 addition, 1 deletioninclude/opendht/callbacks.h
- include/opendht/dhtrunner.h 2 additions, 2 deletionsinclude/opendht/dhtrunner.h
- src/dht.cpp 7 additions, 8 deletionssrc/dht.cpp
- src/dhtrunner.cpp 3 additions, 3 deletionssrc/dhtrunner.cpp
- src/routing_table.cpp 14 additions, 3 deletionssrc/routing_table.cpp
Loading
Please register or sign in to comment