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 Apr 16, 2020. It is now read-only.
This paper seems to solve a similar problem as bitswap-ml, but in the context of the Gnutella network.
The features they used were:
"an indication of whether all of the peer’s upload slots were currently full (busy flag)"
"an indication of whether the peer had successfully uploaded at least one file (uploaded flag)"
"an indication of whether the peer was firewalled (firewall flag)"
"a number representing the connection speed (speed field)"
"an indication of whether the speed field was measured or set by the user (measured flag)"
Using these attributes they created a decision tree to rank peers on a discrete scale from "Very Likely Slow" to "Very Likely Fast". They also found that having the busy flag set was highly correlated with poor connections, so they gave busy peers their own rating, "B", which is a rank lower than Very Likely Slow, and did not include it in the decision tree. Some interesting results they found when creating the tree were:
Firewalled hosts were often faster for some unknown reason
The upload flag and speed field were the most relevant features
Once potential peers were ranked using the decision tree, the researchers used a Markov decision process to intelligently perform partial downloads to find the best peers in minimal time.
The text was updated successfully, but these errors were encountered:
I'll try to read this in next couple of days. but skimming it, this isn't a good paper. they collected very little data and tried very few things. compare to, for example, papers like these
http://iptps03.cs.berkeley.edu/final-papers/adaptive_selection.pdf
This paper seems to solve a similar problem as bitswap-ml, but in the context of the Gnutella network.
The features they used were:
Using these attributes they created a decision tree to rank peers on a discrete scale from "Very Likely Slow" to "Very Likely Fast". They also found that having the busy flag set was highly correlated with poor connections, so they gave busy peers their own rating, "B", which is a rank lower than Very Likely Slow, and did not include it in the decision tree. Some interesting results they found when creating the tree were:
Once potential peers were ranked using the decision tree, the researchers used a Markov decision process to intelligently perform partial downloads to find the best peers in minimal time.
The text was updated successfully, but these errors were encountered: