Research Article
A simulation study of block management in BitTorrent
@INPROCEEDINGS{10.1145/1146847.1146906, author={Hao Luan and Danny H.K. TSANG}, title={A simulation study of block management in BitTorrent}, proceedings={1st International ICST/Create-Net Workshop on Peer-to-Peer Information Management}, publisher={ACM}, proceedings_a={P2PIM}, year={2006}, month={6}, keywords={}, doi={10.1145/1146847.1146906} }
- Hao Luan
Danny H.K. TSANG
Year: 2006
A simulation study of block management in BitTorrent
P2PIM
ACM
DOI: 10.1145/1146847.1146906
Abstract
Among the existing P2P systems for content distribution, BitTorrent (BT) is the most popular one which has attracted keen attentions from both industrial and academic forces in recent years. Its superior performance is due to the multipart downloading scheme by dividing the large file into thousands of small blocks to enable the cooperative downloading among participants. Since transmissions are provoked by interested blocks only, the block distribution will seriously affects the performance of the system, i.e., robustness and throughput. As a result, how to manage the circulation of blocks is important both theoretically and practically. BT leverages on the Local Rarest First scheme to pursue the even distribution of blocks to help peers locate what they need easily. Surprisingly, how good is its performance with heterogenous networks has never received research attention before and this motivates our work. In this study, we carried out simulations to investigate the evolution of block distribution in BT. We find that the block distribution is far from optimal in terms of block frequency (with some blocks dominating the network and some becoming extinct nearly) and topology (with same blocks tending to conglomerate). We also propose a simple source coding mechanism to achieve a BT like network with much improved performance in this view.