-
Notifications
You must be signed in to change notification settings - Fork 851
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
Added balancing group implementation. #1257
base: master
Are you sure you want to change the base?
Conversation
// least one packet behind, just wait for it to be ready. | ||
// Use again the waiting function because we don't want | ||
// the general waiting procedure to skip others. | ||
set<SRTSOCKET> elephants; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
dynamic memory allocation on every receive call
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
These three concerns regarding this PR:
- The “window” algorithm needs a more descriptive name. Maybe "flightspan".
- Dynamic memory allocation on every receive call.
- Mixing two algorithms (fixed and window) in one PR.
Nothing dramatic though.
No. 1 and no. 2 can be addressed as technical debt.
No. 3 might make sense as a compromise to save time.
TODO
|
Converted to draft because this is likely the abandoned prototype that uses synchronization on message numbers.