Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Evaluation - Performance 2005
Analysis of peer-to-peer file dissemination
ACM SIGMETRICS Performance Evaluation Review
Cooperative content distribution: scalability through self-organization
Self-star Properties in Complex Information Systems
A Stable Random-Contact Algorithm for Peer-to-Peer File Sharing
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
On uncoordinated file distribution with non-altruistic downloaders
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
On the stability of two-chunk file-sharing systems
Queueing Systems: Theory and Applications
Formalization of emergence in multi-agent systems
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Hi-index | 0.00 |
BitTorrent revolutionized the technique of distributing a very large file to a very large number of recipients. The file is chopped into small chunks that the recipients can immediately upload further. In the original design, a "tracker" keeps certain centralized control over the chunk transfer process. This paper studies a BitTorrent-like "information diffusion" system that has a fully distributed and symmetric architecture. The peers join a Distributed Hash Table -based overlay network and contact each other randomly. This kind of designs have been implemented and analysed recently. A trackerless BitTorrent system has been introduced which can be regarded as one based on random encounters --- the participating nodes contact each other at random and download missing chunks. On the analytical front, Massoulie and Vojnovic showed that a random encounter based system has surprisingly good performance without any chunk preference strategies, with the condition that each peer gets its first chunk from a sufficiently uniform distribution. In this paper, we focus on a scenario where this condition cannot be guaranteed, and show that a "rare chunk phenomenon" easily occurs, if both the encounters and the chunk selection are random. Classic urn models give some mathematical understanding of this phenomenon. We then discuss various techniques for alleviating the rare chunk problem and propose a simple distributed chunk selection policy that reduces the imbalance in the distribution of chunks within the network.