On the stability of two-chunk file-sharing systems

Abstract

We consider five different peer-to-peer file sharing systems with two chunks, with the aim of finding chunk selection algorithms that have provably stable performance with any input rate and assuming non-altruistic peers who leave the system immediately after downloading the second chunk. We show that many algorithms that first looked promising lead to unstable or oscillating behavior. However, we end up with a system with desirable properties. Most of our rigorous results concern the corresponding deterministic large system limits, but in two simplest cases we provide proofs for the stochastic systems also.

19 pages, 7 figures

References in corpus (1)

• A survey of random processes with reinforcement

Cited by in corpus (5)

• On The Scalability of P2P Swarming Systems
• A Stable Fountain Code Mechanism for Peer-to-Peer Content Distribution
• Stability of a Peer-to-Peer Communication System
• Mode-Suppression: A Simple, Stable and Scalable Chunk-Sharing Algorithm for P2P Networks
• Spatial Interactions of Peers and Performance of File Sharing Systems