On The Scalability of P2P Swarming Systems

TL;DR

This paper investigates the scalability of P2P swarming systems by modeling throughput under various peer and block selection policies, providing insights and mechanisms to enhance system capacity.

Contribution

It introduces models to analyze P2P throughput, revealing new operational regions and strategies to improve scalability and performance.

Findings

System capacity increases with strategic peer selection.

Operational regions for swarm performance are identified.

Performance improves when peers reduce service rates with near-complete files.

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.