Fast Download but Eternal Seeding: The Reward and Punishment of Sharing Ratio Enforcement

Fast Download but Eternal Seeding: The Reward and Punishment of Sharing Ratio Enforcement

Jia, L. (TU Delft Dataintensive Systems)
Rahman, R (TU Delft Dataintensive Systems)
Vinko, T. (TU Delft Dataintensive Systems)
Pouwelse, J.A. (TU Delft Dataintensive Systems)
Epema, D.H.J. (TU Delft Dataintensive Systems)

Asami, T (editor)
Higashino, T (editor)
Ghodsi, A (editor)

2011

Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute their upload resources. It has been demonstrated that communities that use SRE are greatly oversupplied, i.e., they have much higher seeder-to-leecher ratios than communities in which SRE is not employed. The first order effect of oversupply under SRE is a positive increase in the average downloading speed. However, users are forced to seed for extremely long times to maintain adequate sharing ratios to be able to start new downloads. In this paper, we propose a fluid model to study the effects of oversupply under SRE, which predicts the average downloading speed, the average seeding time, and the average upload capacity utilization for users in communities that employ SRE. We notice that the phenomenon of oversupply has two undesired negative effects: a) Peers are forced to seed for long times, even though their seeding efforts are often not very productive (in terms of low upload capacity utilization); and b) SRE discriminates against peers with low bandwidth capacities and forces them to seed for longer durations than peers with high capacities. To alleviate these problems, we propose four different strategies for SRE, which have been inspired by ideas in social sciences and economics. We evaluate these strategies through simulations. Our results indicate that these new strategies release users from needlessly long seeding durations, while also being fair towards peers with low capacities and maintaining high system-wide downloading speeds.

Communities
Steady-state
Peer to peer computing
Bandwidth
IEEE Communications Society
Analytical models
Thin film transistors

http://resolver.tudelft.nl/uuid:0d2684df-38fc-4189-98f4-625c6f67e150

https://doi.org/10.1109/P2P.2011.6038746

IEEE Society, Piscataway, NJ

978-1-4577-0149-8

2011 IEEE International Conference on Peer-to-Peer Computing (P2P11)

P2P11, 2011-08-31 → 2011-09-02, Piscataway, NJ, USA

Accepted Author Manuscript

Institutional Repository

conference paper

© 2011 L. Jia, R Rahman, T. Vinko, J.A. Pouwelse, D.H.J. Epema