feat: extend dynamic latency-based routing strategy with k-top-nodes option
#635
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
nikolay-komarevskiy
force-pushed
the
komarevskiy/latency-routing-k-top-nodes
branch
3 times, most recently
from
75230ea to
67281a0
Compare
nikolay-komarevskiy
force-pushed
the
komarevskiy/latency-routing-k-top-nodes
branch
from
543a6d6 to
4d421b5
Compare
nikolay-komarevskiy
force-pushed
the
komarevskiy/latency-routing-k-top-nodes
branch
from
d3a9977 to
4e6f2d9
Compare
adamspofford-dfinity
approved these changes
Feb 25, 2025
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
Existing dynamic latency-based routing strategy is modified to accept an optional argument
k_top_nodes.Once set, requests are routed to only
knodes with the highest rank (score based on latencies and availabilities measurements). The requests distribution to theseknodes is (as previously) based on the weighted random sampling algorithm, where nodes with higher score are chosen more frequently.How Has This Been Tested?
Unit tests have been adjusted.
Checklist: