On the impact of seed scheduling in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Copyright protection in P2P networks by false pieces pollution
ATC'11 Proceedings of the 8th international conference on Autonomic and trusted computing
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
A P2P computing system for overlay networks
Future Generation Computer Systems
Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach
INFORMS Journal on Computing
| Hi-index | 0.00 |
Peer-to-peer networks provide better scalability for the filesharing applications they underlie. Unlike traditional server-based approach such as FTP, maintaining a constant QoS with a fixed number of servers seems feasible, whatever the number of peers involved. However, a P2P filesharing network sometimes happens to saturate, notably in a semi-P2P filesharing architecture or during flashcrowds phase, and scalability may fail. Even "smart" networks can encounter the whole file but one piece downloaded case, which we call starvation. We suggest a simple and versatile filesharing model. It applies to all pieces-oriented filesharing protocols used in softwares such as MlDonkey or BitTorrent. Simulations of this model show that starvation may occur even during flashcrowds. We propose a theoretical explanation for the so-called starvation phenomenum.