Analyzing Multiple File Downloading in BitTorrent
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Analysis of peer-to-peer file dissemination
ACM SIGMETRICS Performance Evaluation Review
Making p2p accountable without losing privacy
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Content availability and bundling in swarming systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Multi-torrent: a performance study and applications
International Journal of Advanced Media and Communication
Demand-aware content distribution on the internet
IEEE/ACM Transactions on Networking (TON)
Dynamic swarm management for improved BitTorrent performance
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
How prevalent is content bundling in BitTorrent
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Improving file distribution performance by grouping in peer-to-peer networks
IEEE Transactions on Network and Service Management
Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution
IEEE Journal on Selected Areas in Communications
A performance study of BitTorrent-like peer-to-peer systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Peer-to-Peer (P2P) file sharing attracts much attention due to its scalability and robustness. One important metric in measuring the performance of a P2P file sharing system is the amount of time required for all peers to get the files. We refer this time as the file distribution time. Researchers have proposed protocols to minimize the file distribution time under different situation. However, most works are based on the single-file scenario. On the other hand, there are studies showing that in a file sharing application, users may download multiple files at the same time. In this paper, we analyze the minimum time needed to distribute multiple files. We develop an explicit expression for the minimum amount of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file is not always achievable. With a comprehensive consideration of all the configurations, we elaborate how to partition the bandwidth capacities of both seeds and leechers for a particular file such that the finish time is optimal.