Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

deterministic subsetting algorithm to limit the number of instances #1288

Closed
jizhuozhi opened this issue Oct 10, 2023 · 0 comments · Fixed by #1289
Closed

deterministic subsetting algorithm to limit the number of instances #1288

jizhuozhi opened this issue Oct 10, 2023 · 0 comments · Fixed by #1289
Assignees
Milestone

Comments

@jizhuozhi
Copy link
Contributor

jizhuozhi commented Oct 10, 2023

Is your feature request related to a problem? Please describe.
Many RPCs use connection pools and long connections to reduce TCP handshake overhead (including RPC over HTTP). In a very large-scale cluster, there may be tens of thousands of instances (such as a search engine). If the client establishes connections with all instances, all available TCP ports will be quickly exhausted.

Describe the solution you'd like
In order to solve this problem, in very large-scale clusters, each client should only select a limited subset to establish connections. Google SRE provides a deterministic subsetting algorithm solution, see https://sre.google/sre-book/load-balancing-datacenter

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
No open projects
Status: Done
Development

Successfully merging a pull request may close this issue.

4 participants