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 Jan 7, 2022. It is now read-only.
I am looking to add functionality for volunteer archival in an app, in such a way that the user can specify an arbitrary amount of space, and the application will download as many files from the Dat archive as possible. My current working solution is just to pick files at random up to the storage limit.
The problem is that users can also specify certain files to download before filling the rest of the space at random. And since some files are more popular than others, the distribution becomes uneven across the network.
Is there a way to estimate file redundancy as to download the least redundant files first?
The text was updated successfully, but these errors were encountered:
I am looking to add functionality for volunteer archival in an app, in such a way that the user can specify an arbitrary amount of space, and the application will download as many files from the Dat archive as possible. My current working solution is just to pick files at random up to the storage limit.
The problem is that users can also specify certain files to download before filling the rest of the space at random. And since some files are more popular than others, the distribution becomes uneven across the network.
Is there a way to estimate file redundancy as to download the least redundant files first?
The text was updated successfully, but these errors were encountered: