Modeling and Analysis of Bandwidth-Inhomogeneous Swarms in BitTorrent

被引:11
作者
Meulpolder, M. [1 ]
Pouwelse, J. A. [1 ]
Epema, D. H. J. [1 ]
Sips, H. J. [1 ]
机构
[1] Delft Univ Technol, Parallel & Distributed Syst Grp, Dept Comp Sci, NL-2600 AA Delft, Netherlands
来源
2009 IEEE NINTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P 2009) | 2009年
关键词
D O I
10.1109/P2P.2009.5284523
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A number of analytical models exists that capture various properties of the BitTorrent protocol. However, until now virtually all of these models have been based on the assumption that the peers in the system have homogeneous bandwidths. As this is highly unrealistic in real swarms, these models have very limited applicability. Most of all, these models implicitly ignore BitTorrent's most important property: peer selection based on the highest rate of reciprocity. As a result, these models are not suitable for understanding or predicting the properties of real BitTorrent networks. Furthermore, they are hardly of use in the design of realistic BitTorrent simulators and new P2P protocols. In this paper, we extend existing work by presenting a model of a swarm in BitTorrent where peers have arbitrary upload and download bandwidths. In our model we group peers with (roughly) the same bandwidth in classes, and then analyze the allocation of upload slots from peers in one class to peers in another class. We show that our model accurately predicts the bandwidth clustering phenomenon observed experimentally in other work, and we analyze the resulting data distribution in swarms. We validate our model with experiments using real BitTorrent clients. Our model captures the effects of BitTorrent's well-known 'tit-for-tat' mechanism in bandwidth-inhomogeneous swarms and provides an accurate mathematical description of the resulting dynamics.
引用
收藏
页码:232 / 241
页数:10
相关论文
共 11 条
[1]   Playing with the Bandwidth Conservation Law [J].
Benbadis, Farid ;
Mathieu, Fabien ;
Hegde, Nidhi ;
Perino, Diego .
P2P'08: EIGHTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2008, :140-149
[2]  
Cohen B, 2003, WORKSHOP EC PEERTOPE, V6
[3]   Bounds on the performance of P2P networks using tit-for-tat strategies [J].
DeFigueiredo, Dimitri ;
Venkatachalam, Balaji ;
Wu, S. Felix .
P2P: SEVENTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2007, :11-18
[4]   Analysis of resource transfers in peer-to-peer file sharing applications using fluid models [J].
Gaeta, R ;
Gribaudo, M ;
Manini, D ;
Sereno, M .
PERFORMANCE EVALUATION, 2006, 63 (03) :149-174
[5]  
KUMAR R, 2006, P IEEE WORKSH HOT TO
[6]  
Legout A, 2007, PERF E R SI, V35, P301
[7]  
MUNDINGER J, 2006, SIGMETRICS 06, P5
[8]  
PARVEZ N, 2008, SIGMETRICS PERFORM E, V36, P301
[9]  
PIATEK M, 2007, NSDI 07
[10]  
Qiu D., 2004, ACM SIGCOMM