You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
HRW hashing works well for load distribution, but if the preferred peer is down, we'll still keep trying to connect to it on every single RPC. This is fine if we have a low number of RPCs, but can have high overhead on high RPS calls.
I think the behaviour we want is:
Have a background goroutine that connects to the most available preferred peer
On a request, try to find the most preferred peer that is connected
If there are not connected peers, then return the top preferred peer (even if it's unconnected)
The background goroutine should ensure that we have connections to the top N peers.
The text was updated successfully, but these errors were encountered:
HRW hashing works well for load distribution, but if the preferred peer is down, we'll still keep trying to connect to it on every single RPC. This is fine if we have a low number of RPCs, but can have high overhead on high RPS calls.
I think the behaviour we want is:
The background goroutine should ensure that we have connections to the top N peers.
The text was updated successfully, but these errors were encountered: