You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Nov 16, 2021. It is now read-only.
This is something that in combination with node benchmarking (selection based on for example bandwidth) would reduce the transfer time and increase transfer speed. Bittorrent does this well.
This should improve the performance towards the end of a file transfer where it's typical to see a decrease in speed when the concurrency decreases due to there only being a few shards left.
Yes it could allow for better performance and bursts an specific positions. The issue with streaming though is that there can be wildly inconsistent behavior. If the first shard happens to be the shard than has gone missing and will need to be recovered, with reed solomon, it will be necessary to download enough data to be able to recover that shard, which would be a noticeable delay. I believe it's possible to do partial recovery without downloading the entire file, however it will still be more data than the size of the first shard.
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
This is something that in combination with node benchmarking (selection based on for example bandwidth) would reduce the transfer time and increase transfer speed. Bittorrent does this well.
Reference: storj-archived/core#705
The text was updated successfully, but these errors were encountered: