Abstract
As the source of the content in P2P systems, the main objective of the seed is to help deliver the content to all peers as soon as possible and to ensure the quality of service of the peers as well as to stimulate them to contribute resources to the system. Recent researches mostly concentrate on either the unchoking algorithms of the leechers or the scheduling algorithms of the seed.In contrast, the unchoking algorithms of the seeds have drawn little attention. Experimental results have shown that the unchoking algorithm of the seeds may have a remarkable impact on the performance of the system, especially when there are a large amount of free-riders in the system. Firstly, a P2P content delivery model based on the fluid model is established in this paper. Secondly, a biased seed unchoking algorithm (BSU) is put forward. Finally, a series of experiments in both homogeneous and heterogeneous environments are conducted to investigate the performance of BSU. Experimental results show that BSU may achieve better performance than existing algorithm used in BitTorrent-like systems remarkably.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Esposito, F., Matta, I., Bera, D., Michiardi, P.: On the impact of seed scheduling in peer-to-peer networks. Computer Networks (2011)
Qiu, D., Srikant, R.: Modeling and Performance Analysis of BitTorrent-like Peer-to-Peer Networks. SIGCOMM (September 2004)
Meulpolder, M., Pouwelse, J.A., Epema, D.H.J., Sips, H.J.: Modeling and Analysis of Bandwidth-Inhomogeneous Swarms in BitTorrent. IEEE P2P (September 2009)
Kamvar, S., Schlosser, M., Garcia-Molina, H.: The EigenTrust Algorithm for Reputation Management in P2P Networks. In: Proc. of the Twelfth International World Wide Web Conference (2003)
Al-Hamra, A., Legout, A., Barakat, C.: Understanding the properties of the bittorrent overlay. INRIA, Tech. Rep. (2007), http://arxiv.org/pdf/0707.1820
Bharambe, A., Herley, C.: Analyzing and Improving BitTorrent Performance. Technical Report MSR-TR-2005-03, Microsoft Research (2005)
Liu, Z., Dhungel, P., Wu, D., Zhang, C., Ross, K.: Understanding and improving ratio incentives in private communities. In: Proc. IEEE Int. Conf. on Distributed Computing Systems (ICDCS), Genoa, Italy (August 2010)
Wei, X., Chen, M., Tang, C., Bai, H., Zhang, G., Wang, Z.: iRep: Indirect Reciprocity Reputation based Efficient Content Delivery in BT-like Systems. Telecommunication Systems (accepted)
Wei, X., Ahmed, T., Chen, M., Pathan, A.-S.: PeerMate: A malicious peer detection algorithm for P2P Systems based on MSPCA. In: Proc. IEEE Int. Conf. on Computing, Networking and Communications (ICNC), Lahaina, HI, USA (January 2012)
BitTorrent, http://www.bittorrent.com
Bharambe, A.R., Herley, C., Padmanabhan, V.N.: Analyzing and improving a bittorrent networks performance mechanisms. In: INFOCOM 2006, 25th IEEE International Conference on Computer Communications, pp. 1–12 (April 2006)
Cuevas, R., Kryczka, M., Cuevas, A., Kaune, S., Guerrero, C., Rejaie, R.: Is content publishing in BitTorrent altruistic or profit-driven? In: Proceedings of the 6th International Conference (Co-NEXT 2010). ACM, New York (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, X., Zhang, G., Fan, J., Chen, M. (2012). BSU: A Biased Seed Unchoking Algorithm for P2P Systems. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds) Internet and Distributed Computing Systems. IDCS 2012. Lecture Notes in Computer Science, vol 7646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34883-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-34883-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34882-2
Online ISBN: 978-3-642-34883-9
eBook Packages: Computer ScienceComputer Science (R0)