On The Scalability of P2P Swarming Systems

Abstract

One of the fundamental problems in the realm of peer-to-peer systems is that of determining their service capacities. In this paper, we focus on P2P scalability issues and propose models to compute the achievable throughput under distinct policies for selecting both peers and blocks. From these models, we obtain novel insights on the behavior of P2P swarming systems that motivate new mechanisms for publishers and peers to improve the overall performance. In particular, we obtain operational regions for swarm system. In addition, we show that system capacity significantly increases if publishers adopt the most deprived peer selection and peers reduce their service rates when they have all the file blocks but one.