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
Probability and Random Processes (Wiley Survival Guides in Engineering and Science)
Probability and Random Processes (Wiley Survival Guides in Engineering and Science)
Rarest first and choke algorithms are enough
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
IEEE/ACM Transactions on Networking (TON)
Estimating self-sustainability in peer-to-peer swarming systems
Performance Evaluation
On the stability of two-chunk file-sharing systems
Queueing Systems: Theory and Applications
Implications of peer selection strategies by publishers on the performance of P2P swarming systems
ACM SIGMETRICS Performance Evaluation Review
Heterogeneous download times in a homogeneous BitTorrent swarm
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Peer-to-peer (P2P) communication in networks for file distribution and other applications is a powerful multiplier of network utility, due to its ability to exploit parallelism in a distributed way. As new variations are engineered, to provide less impact on service providers and to provide better quality of service, it is important to have a theoretical underpinning, to weigh the effectiveness of various methods for enhancing the service. This paper focuses on the stationary portion of file download in an unstructured P2P network, which typically follows for many hours after a flash crowd initiation. The contribution of the paper is to identify how much help is needed from the seeds, either fixed seeds or peers dwelling in the system after obtaining the complete file, to stabilize the system. It is shown that dominant cause for instability is the missing piece syndrome, whereby one piece becomes very rare in the network. It is shown that very little dwell time is necessary--even if there is very little help from a fixed seed, peers need to dwell on average no longer than it takes to upload one additional piece, after they have obtained a complete collection.