Stratification in P2P Networks: Application to BitTorrent

We consider a model for decentralized collaborative networks that is based on stable matching theory. This model is applied to systems with a global ranking utility function, which admits a unique stable configuration. We study the speed of convergence and analyze the stratification properties of the stable configuration, both when all collaborations are possible and for random possible collaborations. As a practical example, we consider the BitTorrent Titfor-Tat policy. For this system, our model provides an interesting insight into peer download rates and a good understanding of upload settings strategy.

• Type: Conference
• Year: 2007
• Where: ICDCS
• Authors: Anh-Tuan Gai, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier
• Keywords: Distributed And Parallel Computing, ICDCS 2007, Stable Configuration, Stable Matching Theory, Unique Stable Configuration