Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
The Diameter of a Scale-Free Random Graph
Combinatorica
Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Measurements, analysis, and modeling of BitTorrent-like systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Youtube traffic characterization: a view from the edge
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Content availability and bundling in swarming systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Dynamic swarm management for improved BitTorrent performance
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Power-law revisited: large scale measurement study of P2P content popularity
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
On blind mice and the elephant: understanding the network impact of a large distributed system
Proceedings of the ACM SIGCOMM 2011 conference
Using torrent inflation to efficiently serve the long tail in peer-assisted content delivery systems
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
| Hi-index | 0.00 |
With BitTorrent, efficient peer upload utilization is achieved by splitting contents into many small pieces, each of which may be downloaded from different peers within the same swarm. Unfortunately, piece and bandwidth availability may cause the file-sharing efficiency to degrade in small swarms with few participating peers. Using extensive measurements, we identified hundreds of thousands of torrents with several small swarms for which reallocating peers among swarms and/or modifying the peer behavior could significantly improve the system performance. Motivated by this observation, we propose a centralized and a distributed protocol for dynamic swarm management. The centralized protocol (CSM) manages the swarms of peers at minimal tracker overhead. The distributed protocol (DSM) manages the swarms of peers while ensuring load fairness among the trackers. Both protocols achieve their performance improvements by identifying and merging small swarms and allow load sharing for large torrents. Our evaluations are based on measurement data collected during eight days from over 700 trackers worldwide, which collectively maintain state information about 2.8 million unique torrents. We find that CSM and DSM can achieve most of the performance gains of dynamic swarm management. These gains are estimated to be up to 40% on average for small torrents.