Optimal broadcasting on SIMD hypercubes without indirect addressing capability
Journal of Parallel and Distributed Computing
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 amongst users of different upload capacities
ACM SIGMETRICS Performance Evaluation Review
Flash crowd in a file sharing system based on random encounters
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Cooperative content distribution: scalability through self-organization
Self-star Properties in Complex Information Systems
Estimating self-sustainability in peer-to-peer swarming systems
Performance Evaluation
| Hi-index | 0.00 |
We consider a BitTorrent-like file sharing system, where the peers interested in downloading a large file join an overlay network. The seed node possessing the file stays in the system, whereas all other peers are non-altruistic in the sense that they leave the system as soon as they have downloaded the whole file. We consider a flash crowd scenario, where the peers join the overlay simultaneously. We show that the chunk selection algorithm is critical, propose an analytic approach to the process, and find that the encounters can be restricted to neighbours in a Chord overlay without losing much in performance.