IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Measurements, analysis, and modeling of BitTorrent-like systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Rescuing Tit-for-Tat with Source Coding
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
The bittorrent p2p file-sharing system: measurements and analysis
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Resource demand and supply in BitTorrent content-sharing communities
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Activeness-Based Seed Choking Algorithm for Enhancing BitTorrent's Robustness
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
Measurement studies have shown that real world BitTorrent (BT) systems exhibit high seed capacity. Thus, appropriate use of seed capacity can have a significant effect on BT performance. Moreover, seed capacity is also easily exploitable by free-riders, and such free-riding clients exist out in the wild today. In this paper, we propose a simple and scalable approach that makes more intelligent use of seed capacity by hurting free-riders, without their explicit identification, while improving the performance of contributing nodes. The effectiveness of our approach is studied via extensive simulations.