Abstract
BitTorrent has gained momentum in recent years as an effective means of distributing digital content in the Internet. Despite the remarkable scalability and efficiency properties that characterize BitTorrent in the long haul, several studies identify the source of the content as the main culprit for the poor performance of the system in a transient regime where user requests for a popular content swamp the source and in case of high node churn. Our work models the scheduling decisions made at the source (called the seed) for selecting which pieces of the content to inject in the system through a stochastic optimization process and provides an analytical framework to compare different strategies. We define a new piece selection algorithm (called proportional fair scheduling, PFS) that incorporates the seed’s limited vision of the system dynamics in terms of user requests so as to ensure a better content distribution among the users. We prove convergence of PFS and compare its short and long term performance against the mainline BitTorrent implementation and the “smart seed” technique recently introduced in [9]. Our results show that PFS induces substantial improvements on both system performance, by decreasing the download time at the users, and system robustness against peer dynamics, by quickly reacting to sudden changes in the request patterns of the users.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Legout, A., Urvoy-Keller, G., Michiardi, P.: Rarest First and Choke Algorithms Are Enough. In: ACM SIGCOMM/USENIX IMC 2006, Rio de Janeiro, Brazil, ACM, New York (2006)
Urvoy-Keller, G., Michiardi, P.: Impact of Inner Parameters and Overlay Structure on the Performance of BitTorrent. In: IEEE Global Internet Symposium 2006, Barcelona, Spain, IEEE, Los Alamitos (2006)
Tian, Y., Wu, D., Ng, K.W.: Modeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks. In: IEEE INFOCOM 2006, Barcelona, Spain, IEEE, Los Alamitos (2006)
Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrentlike peer-to-peer networks. In: ACM SIGCOMM 2004, Portland, OR, USA, ACM Press, New York (2004)
Fan, B., Chiu, D.-M., Lui, J.C.S.: Stochastic Differential Equation Approach to Model BitTorrent-like P2P Systems. In: IEEE ICC 2006, Istanbul, Turkey, IEEE, Los Alamitos (2006)
Gkantsidis, C., Rodriguez, P.: Network Coding for Large Scale Content Distribution. In: IEEE INFOCOM 2005, Miami, USA, IEEE Computer Society Press, Los Alamitos (2005)
Cohen, B.: Incentives Build Robustness in BitTorrent. In: Workshop on Economics of Peer-to-Peer Systems 2003, Berkeley, USA (2003)
Izal, M., et al.: Dissecting BitTorrent: Five Months in a Torrent’s Lifetime. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol. 3015, Springer, Heidelberg (2004)
Bharambe, A., Herley, C., Padmanabhan, V.N.: Analyzing and Improving a BitTorrent Network’s Performance Mechanisms. In: IEEE INFOCOM 2006, Barcelona, Spain, IEEE, Los Alamitos (2006)
Yang, X., de Veciana, G.: Service capacity in peer-to-peer networks. In: IEEE INFOCOM, Hong Kong, China, IEEE, Los Alamitos (2004)
Mathieu, F., Reynier, J.: Missing Piece Issue and Upload Strategies in Flashcrowds and P2P-assisted Filesharing. Technical Report, ENS, France
Kushner, H.J., Yin, G.: Stochastic Approximation Algorithms and Applications, 2nd edn. Springer, Berlin (2003)
Kushner, H.J., Whiting, P.A.: Convergence of Proportional-Fair Sharing Algorithms Under General Conditions. IEEE Transactions on Wireless Communications 3(4) (2004)
Erman, D., Ilie, D., Popescu, A.: BitTorrent Session and Message Models. In: ICCGI 2006, Bucharest, Romania (2006)
Radunović, B., Le Boudec, J.Y.: A Unified Framework for Max-Min and Min-Max Fairness with Applications. Technical Report, EPFL (July 2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Michiardi, P., Ramachandran, K., Sikdar, B. (2007). Modeling Seed Scheduling Strategies in BitTorrent. In: Akyildiz, I.F., Sivakumar, R., Ekici, E., Oliveira, J.C.d., McNair, J. (eds) NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet. NETWORKING 2007. Lecture Notes in Computer Science, vol 4479. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72606-7_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-72606-7_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72605-0
Online ISBN: 978-3-540-72606-7
eBook Packages: Computer ScienceComputer Science (R0)