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.

Sign up for GitHub

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

Jump to bottom

From "round-robin" to "random-pick" ? #8

Open
sbernard31 opened this issue Jul 4, 2019 · 0 comments
Open

From "round-robin" to "random-pick" ? #8

sbernard31 opened this issue Jul 4, 2019 · 0 comments

Comments

@sbernard31
Copy link
Contributor

Currently the algorithm to dispatch traffic is very simple.
It's just a simple circular rotation :

  1. For 1st association we take the 1st real server,
  2. Then 2nd association we take the 2nd real server,
  3. After the last real server we go back to the beginning.

To do that we need a state : the last(or next) real server used.

The idea of "doing a random pick" was raised. This way we could remove the state.
We could investigate this.

Maybe we can use : bpf_get_prandom_u32 helper function.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@sbernard31