CREW: A Gossip-based Flash-Dissemination System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Operating system support for planetary-scale network services
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scale and performance in the CoBlitz large-file distribution service
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
An Activeness-Based Seed Choking Algorithm for Enhancing BitTorrent's Robustness
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Active measurement of routing table in Kad
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Improving peer-to-peer file distribution: winner doesn't have to take all
Proceedings of the first ACM asia-pacific workshop on Workshop on systems
Kangaroo: video seeking in P2P systems
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Evaluating stranger policies in P2P file-sharing systems with reciprocity mechanisms
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the performance and fairness of BitTorrent-like data swarming systems with NAT devices
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Peer-to-peer content distribution systems have been enjoying great popularity, and are now gaining momentum as a means of disseminating video streams over the Internet. In many of these protocols, including the popular BitTorrent, content is split into mostly fixed-size pieces, allowing a client to download data from many peers simultaneously. This makes piece size potentially critical for performance. However, previous research efforts have largely overlooked this parameter, opting to focus on others instead. This paper presents the results of real experiments with varying piece sizes on a controlled Bit-Torrent testbed.We demonstrate that this parameter is indeed critical, as it determines the degree of parallelism in the system, and we investigate optimal piece sizes for distributing small and large content. We also pinpoint a related design tradeoff, and explain how BitTorrent's choice of dividing pieces into subpieces attempts to address it.