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

[std] Congestion control for catchunks #97

Open
pulsejet opened this issue Jan 3, 2025 · 3 comments · May be fixed by #132
Open

[std] Congestion control for catchunks #97

pulsejet opened this issue Jan 3, 2025 · 3 comments · May be fixed by #132
Labels
std go-ndn issues

Comments

@pulsejet
Copy link
Collaborator

pulsejet commented Jan 3, 2025

Current implementation is fixed window.

@pulsejet pulsejet added enhancement New feature or request std go-ndn issues labels Jan 3, 2025
@pulsejet pulsejet changed the title Congestion control for catchunks [std] Congestion control for catchunks Jan 3, 2025
@pulsejet pulsejet removed the enhancement New feature or request label Jan 3, 2025
@AnoldGH
Copy link

AnoldGH commented Feb 15, 2025

What algorithms should we support? AIMD and Cubic?

I wonder if window size control should be made an independent module and separated from fetcher logic. It might be useful to other future apps as well.

@pulsejet
Copy link
Collaborator Author

For getting started, I'll suggest whatever has lower complexity (my recollection is not very good)

@AnoldGH
Copy link

AnoldGH commented Feb 16, 2025

For getting started, I'll suggest whatever has lower complexity (my recollection is not very good)

I have created a draft PR (actually through an accidental touch) #131 , which contains some basic window control/signalling functionalities. LMK if that's a good start

@AnoldGH AnoldGH linked a pull request Feb 21, 2025 that will close this issue
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
std go-ndn issues
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants