Abstract
BitTorrent suffers from the free-riding problem induced by selfish peers, hurting the system robustness. Existing research studies have focused on the fairness, performance, and robustness of BitTorrent, resulting from the Tit-For-Tat (TFT) choking algorithm, while very few studies have considered the effect of the seed choking algorithm. This paper experimentally analyzes the impact of the free riding of selfish peers on BitTorrent’s performance and robustness, and proposes an activeness-based seed choking algorithm, where according to the activeness values of request peers, which are the ratios of the available download bandwidth to the available upload bandwidth, a seed preferentially uploads to five request peers with the highest activeness values, without any explicit reputation management system. Our simulation experiments show that compared to existing seed choking algorithms, the activeness-based seed choking algorithm not only restrains the free riding of selfish peers but also improves the performance of benign peers, enhancing BitTorrent’s robustness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
The True Picture of Peer-to-Peer File Sharing, http://www.cachelogic.com
Yang, X., Veciana, G.: Service Capacity of Peer-to-Peer Networks. In: Proc. of IEEE INFOCOM, pp. 2242–2252 (2004)
Cohen, B.: Incentives Build Robustness in BitTorrent. In: Proc. of the Workshop on Economics of Peer-to-Peer Systems (2003)
Levin, D., LaCurts, K., Spring, N., et al.: BitTorrent is an Auction: Analyzing and Improving BitTorrent’s Incentives. In: Proc. of ACM SIGCOMM, pp. 243–254 (2008)
Qiu, D., Srikant, R.: Modeling and Performance Analysis of BitTorrent-like Peer-to-Peer Networks. In: Proc. of ACM SIGCOMM, pp. 367–378 (2004)
Massoulie, L., Vojnovic, M.: Coupon Replication Systems. In: Proc. of ACM SIGMETRICS, pp. 2–13 (2005)
Fan, B., Chiu, D.M., Lui, J.C.: The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design. In: Proc. of IEEE ICNP, pp. 239–248 (2006)
Izal, M., Urvoy-Keller, G., Biersack, E.W., et al.: Dissecting BitTorrent: Five Months in a Torrent’s Lifetime. In: Proc. of Passive & Active Measurement Workshop, pp. 1–11 (2004)
Pouwelse, J., Garbacki, P., Epema, D., et al.: The BitTorrent P2P File-Sharing System: Measurements and Analysis. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 205–216. Springer, Heidelberg (2005)
Guo, L., Chen, S., Xiao, Z., et al.: Measurement, Analysis, and Modeling of BitTorrent-like Systems. In: Proc. of IMC, pp. 35–48 (2005)
Legout, A., Urvoy-Keller, G., Michiardi, P.: Rarest First and Choke Algorithms are Enough. In: Proc. of IMC, pp. 203–216 (2006)
Bharambe, A.R., Herley, C., Padmanabhan, V.N.: Analyzing and Improving a BitTorrent Network’s Performance Mechanisms. In: Proc. of IEEE INFOCOM, pp. 1–12 (2006)
Tian, Y., Wu, D., Ng, K.W.: Modeling, Analysis, and Improvement for BitTorre-like File Sharing Networks. In: Proc. of IEEE INFOCOM, pp. 1–11 (2006)
Bindal, R., Cao, P., Chan, W., et al.: Improving Traffic Locality in BitTorrent via Biased Neighbor Selection. In: Proc. of IEEE ICDCS, pp. 66–77 (2006)
Legout, A., Liogkas, N., Kohler, E., et al.: Clustering and Sharing Incentives in BitTorrent Systems. In: Proc. of ACM SIGMETRICS, pp. 301–312 (2007)
Huang, K., Wang, L., Zhang, D., et al.: Optimizing the BitTorrent Performance Using Adaptive Peer Selection Strategy. Future Generation Computer Systems 24(7), 621–630 (2008)
Marciniak, P., Liogkas, N., Legout, A., et al.: Small is Not Always Beautiful. In: Proc. of IPTPS (2008)
Jun, S., Ahamad, M.: Incentives in BitTorrent Induce Free Riding. In: Proc. of the Workshop on Economics of Peer-to-Peer Systems (2005)
Ligokas, N., Nelson, R., Kohler, E., et al.: Exploiting BitTorrent for Fun (But Not Profit). In: Proc. of IPTPS (2006)
Locher, T., Moor, P., Schmid, S., et al.: Free Riding in BitTorrent is Cheap. In: Proc. of HotNets (2006)
Sirivianos, M., Park, J.H., Chen, R., et al.: Free-riding in BitTorrent Networks with the Large View Exploit. In: Proc. of IPTPS (2007)
Piatek, M., Isdal, T., Anderson, T., et al.: Do Incentives Build Robustness in BitTorrent? In: Proc. of NSDI, pp. 1–14 (2007)
Dhungel, P., Wu, D., Schonhorst, B., et al.: A Measurement Study of Attacks on BitTorrent Leechers. In: Proc. of IPTPS (2008)
Chow, A.L., Golubchik, L., Misra, V.: Improving BitTorrent: A Simple Approach. In: Proc. of IPTPS (2008)
Strauss, J., Katabi, D., Kaashoek, F.: A Measurement Study of Available Bandwidth Estimation Tools. In: Proc. of IMC, pp. 39–44 (2003)
BitTorrent, http://www.bittorrent.com/
Douceur, J.R.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 251. Springer, Heidelberg (2002)
Katti, S., Katabi, D., Blake, C., et al.: MultiQ: Automated Detection of Multiple Bottleneck Capacities Along a Path. In: Proc. of IMC, pp. 245–250 (2004)
Kamvar, S., Schlosser, M., Garcia-Molina, H.: The EigenTrust Algorithm for Reputation Management in P2P Networks. In: Proc. of WWW, pp. 640–651 (2003)
Xiong, L., Liu, L.: PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities. IEEE Transactions on Knowledge and Data Engineering 16(7), 843–857 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, K., Zhang, D., Wang, L. (2009). An Activeness-Based Seed Choking Algorithm for Enhancing BitTorrent’s Robustness. In: Abdennadher, N., Petcu, D. (eds) Advances in Grid and Pervasive Computing. GPC 2009. Lecture Notes in Computer Science, vol 5529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01671-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-01671-4_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01670-7
Online ISBN: 978-3-642-01671-4
eBook Packages: Computer ScienceComputer Science (R0)